Sciweavers

Share
38 search results - page 1 / 8
» On Complexity of Optimized Crossover for Binary Representati...
Sort
View
DAGSTUHL
2006
10 years 2 months ago
On Complexity of Optimized Crossover for Binary Representations
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...
Anton V. Eremeev
EC
2008
153views ECommerce» more  EC 2008»
10 years 23 days ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
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...
Anton V. Eremeev
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
10 years 4 months ago
Estimating the destructiveness of crossover on binary tree representations
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...
Luke Sheneman, James A. Foster
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
10 years 5 months ago
Non-Standard Crossover for a Standard Representation - Commonality-Based Feature Subset Selection
The Commonality-Based Crossover Framework has been presented as a general model for designing problem speciļ¬c operators. Following this model, the Common Features/Random Sample ...
Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. ...
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
10 years 7 months ago
Geometric crossovers for real-code representation
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...
Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byun...
books