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

Authors

46

  1. RP
    Riccardo Poli

    University of Essex, United Kingdom

    8 publications · 439 citations

    8

    h-index

  2. MD
    Michael D. Vose

    University of Tennessee at Knoxville, United States

    4 publications · 78 citations

    4

    h-index

  3. CR
    Christopher R. Stephens

    Universidad Nacional Autónoma de México, Mexico

    3 publications · 57 citations

    3

    h-index

  4. JV
    João Viana da Fonseca Neto

    Universidade Federal do Maranhão, Brazil

    2 publications · 24 citations

    2

    h-index

  5. CP
    Celso Pascoli Bottura

    Universidade Estadual de Campinas (UNICAMP), Brazil

    2 publications · 24 citations

    2

    h-index

1–5 of 46

Venues

  1. Evolutionary Computation

    7 publications · 597 citations

    7

    h-index

  2. Genetic and Evolutionary Computation Conference

    Conference · 3 publications · 68 citations

    3

    h-index

  3. ArXiv.org

    Repository · 2 publications · 45 citations

    2

    h-index

  4. IEEE Transactions on Evolutionary Computation

    2 publications · 46 citations

    2

    h-index

  5. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 1 publications · 13 citations

    2

    h-index

1–5