Schema Theorem
The Schema Theorem is a foundational principle in genetic algorithm theory that asserts the expected number of instances of a schema in a population increases over time if the schema is short, low-order, and of above-average fitness.
39
Publications
5.6K
Citations
46
Authors
28
Institutions
Publications per year
2017–2026
1
Parents
39
Convergence analysis of canonical genetic algorithms
Günter Rudolph · IEEE Transactions on Neural Networks · 1994 · 1.5K citations
A parameter-less genetic algorithm
Georges R. Harik, Fernando G. Lobo · 1999 · 242 citations
Architecture, Genetics, Algorithms +16
Schemata Evolution and Building Blocks
Chris Stephens, Henri Waelbroeck · Evolutionary Computation · 1999 · 144 citations
Life Sciences, Evolutionary Biology, Evolutionary Theory +13
1–5 of 39
46
8
h-index
4
h-index
3
h-index
2
h-index
Universidade Estadual de Campinas (UNICAMP), Brazil
2 publications · 24 citations
2
h-index
1–5 of 46
28

University of Birmingham
Birmingham, United Kingdom
6 h-index
7 publications
480 citations
University of Tennessee at Knoxville
Knoxville, United States
3 h-index
4 publications
93 citations

University of Montana
Missoula, United States
2 h-index
2 publications
41 citations

UNSW Sydney
Sydney, Australia
2 h-index
3 publications
128 citations

University of Essex
Colchester, United Kingdom
2 h-index
2 publications
86 citations
Instituto Nacional de Investigaciones Nucleares
Ocoyoacac, Mexico
2 h-index
3 publications
308 citations

Universidade Federal do Maranhão
São Luís, Brazil
2 h-index
2 publications
24 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
2 h-index
2 publications
24 citations
1–8 of 28
7 publications · 597 citations
7
h-index
Conference · 3 publications · 68 citations
3
h-index
Repository · 2 publications · 45 citations
2
h-index
2 publications · 46 citations
2
h-index
Repository · 1 publications · 13 citations
2
h-index
1–5