1639 search results - page 290 / 328 » Anytime Heuristic Search |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...