1830 search results - page 116 / 366 » Optimizing Sorting with Genetic Algorithms |
213
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
184
click to vote
EUROGP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
162
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
167
click to vote
CEC
2008
IEEE
16 years 23 days ago
2008
IEEE
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
156
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...