Sciweavers

738 search results - page 1 / 148
» Crossover can provably be useful in evolutionary computation
Sort
View
71
Voted
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
14 years 10 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein
AIEDAM
2000
134views more  AIEDAM 2000»
14 years 9 months ago
Adaptive enlargement of state spaces in evolutionary designing
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
John S. Gero, Vladimir A. Kazakov
SAC
2003
ACM
15 years 2 months ago
Can a Parser be Generated from Examples?
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...
Marjan Mernik, Goran Gerlic, Viljem Zumer, Barrett...
AI
2006
Springer
14 years 9 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
PPSN
2004
Springer
15 years 2 months ago
Distribution Tree-Building Real-Valued Evolutionary Algorithm
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
Petr Posik