Abstract
In Chapter 4 we introduced pessimistic schema theories for genetic programming in which schemata are treated as subsets of the search space. These two theories (Rosca’s and ours) do not take schema creation into account and consider only the worst-case scenario for schema disruption. As a result they only provide lower bounds for the expected number of members of the population matching a given schema at the next generation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Langdon, W.B., Poli, R. (2002). Exact GP Schema Theorems. In: Foundations of Genetic Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04726-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-04726-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07632-9
Online ISBN: 978-3-662-04726-2
eBook Packages: Springer Book Archive