Name
Abstract | ||
|---|---|---|
A schema is a naturally defined subset of the space of fixed-length binary strings. The Holland Schema Theorem [Hol75] gives a lower bound on the expected fraction of a population in a schema after one generation of a simple genetic algorithm. This paper gives formulas for the exact expected fraction of a population in a schema after one generation of the simple genetic algorithm. Holland's schema theorem has three parts, one for selection, one for crossover, and one for mutation. The selection ... |
Year | Venue | Keywords |
|---|---|---|
2011 | Computing Research Repository | population model,lower bound,evolutionary computing |
Field | DocType | Volume |
Discrete mathematics,Population,Mathematical optimization,Crossover,Defining length,Upper and lower bounds,Computer science,Algorithm,Corollary,Schema (psychology),Schema (genetic algorithms),Genetic algorithm | Journal | abs/1105.3 |
Citations | PageRank | References |
3 | 0.54 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alden H. Wright | 1 | 330 | 45.58 |