8978 search results - page 179 / 1796 » Parallel Genetic Algorithms |
162
click to vote
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...
170
click to vote
TNN
1998
15 years 6 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
164
click to vote
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...
182
click to vote
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...
165
click to vote
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...