21 search results - page 4 / 5 » foga 2007 |
FOGA
1992
13 years 6 months ago
1992
There has been a lot of recent interest in so-called "steady state" genetic algorithms (GAs) which, among other things, replace only a few individuals (typically 1 or 2)...
FOGA
2007
13 years 6 months ago
2007
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is deļ¬ned using the distance associated to the search space in ...
FOGA
2007
13 years 6 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
FOGA
1994
13 years 6 months ago
1994
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
FOGA
1992
13 years 6 months ago
1992
The building-block hypothesis states that the GA works well when short, low-order, highly-fit schemas recombine to form even more highly fit higher-order schemas. The ability to p...