5082 search results - page 152 / 1017 » Hierarchical Genetic Algorithms |
178
Voted
PR
1998
15 years 6 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
185
Voted
JDCTA
2010
15 years 1 months ago
2010
The recent area of Wireless Sensor Networks (WSNs) has brought new challenges to developers of net-work protocols. Energy consumption and network coverage are two important challe...
197
Voted
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
187
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
155
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a su...