Sciweavers

158 search results - page 1 / 32
» On Complexity of Optimal Recombination for Binary Representa...
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
13 years 3 months 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
DAGSTUHL
2006
13 years 5 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
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
13 years 8 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
13 years 10 months ago
Self-adaptive simulated binary crossover for real-parameter optimization
Simulated binary crossover (SBX) is a real-parameter recombination operator which is commonly used in the evolutionary algorithm (EA) literature. The operator involves a parameter...
Kalyanmoy Deb, Karthik Sindhya, Tatsuya Okabe
PPSN
2004
Springer
13 years 9 months ago
On the Importance of Information Speed in Structured Populations
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
Mike Preuss, Christian Lasarczyk