Sciweavers

5 search results - page 1 / 1
» Multi-parent Recombination in Genetic Algorithms with Search...
Sort
View
PPSN
1998
Springer
13 years 8 months ago
Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
Shigeyoshi Tsutsui
GECCO
2000
Springer
13 years 8 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
EC
2006
163views ECommerce» more  EC 2006»
13 years 4 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
ECP
1997
Springer
128views Robotics» more  ECP 1997»
13 years 8 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
AAAI
1998
13 years 6 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies