38 search results - page 1 / 8 » On Complexity of Optimized Crossover for Binary Representati... |
DAGSTUHL
2006
13 years 10 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
EC
2008
13 years 8 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
GECCO
2006
Springer
14 years 5 days ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
GECCO
1999
Springer
14 years 24 days ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Geometric crossover is a representation-independent generalization of the class of traditional mask-based crossover for binary strings. It is based on the distance of the search s...