38 search results - page 2 / 8 » On Complexity of Optimized Crossover for Binary Representati... |
GECCO
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In this paper we give a representation-independent topological definition of crossover that links it tightly to the notion of fitness landscape. Building around this defi...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
GECCO
2003
Springer
13 years 9 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
AIR
1998
13 years 4 months ago
1998
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...