3120 search results - page 144 / 624 » A parameter-less genetic algorithm |
131
click to vote
PR
1998
15 years 3 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...
134
Voted
TNN
1998
15 years 3 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...
156
Voted
PAMI
2006
15 years 3 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...
129
Voted
GECCO
2006
Springer
15 years 7 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...
114
Voted
GECCO
2007
Springer
15 years 9 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...