Exact GP Schema Theory for Headless Chicken Crossover and Subtree Mutation
Created by W.Langdon from
gpbibliography.bib Revision:1.8010
 @InProceedings{poil:2001:egsthccsm,

author = "Riccardo Poli and Nicholas F. McPhee",

title = "Exact GP Schema Theory for Headless Chicken Crossover
and Subtree Mutation",

booktitle = "Proceedings of the 2001 Congress on Evolutionary
Computation CEC2001",

year = "2001",

pages = "10621069",

address = "COEX, World Trade Center, 159 Samseongdong,
Gangnamgu, Seoul, Korea",

publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
088551331, USA",

month = "2730 " # may,

organisation = "IEEE Neural Network Council (NNC), Evolutionary
Programming Society (EPS), Institution of Electrical
Engineers (IEE)",

publisher = "IEEE Press",

keywords = "genetic algorithms, genetic programming, schema
theory, headless chicken crossover, subtree mutation,
operator biases, exact genetic programming schema
theory, headless chicken crossover, macroscopic
quantities, microscopic quantities, operators, schema
instances expected number, subtree mutation, theory
specialisation, mathematical operators, programming
theory, trees (mathematics)",

ISBN = "0780366581",

URL = "http://cswww.essex.ac.uk/staff/rpoli/papers/PoliCEC2001.pdf",

DOI = "doi:10.1109/CEC.2001.934309",

abstract = "A new general genetic programming (GP) schema theory
for headless chicken crossover and subtree mutation is
presented. The theory gives an exact formulation for
the expected number of instances of a schema at the
next generation, either in terms of microscopic
quantities or in terms of macroscopic ones. This paper
gives examples which show how the theory can be
specialised to specific operators",

notes = "CEC2001  A joint meeting of the IEEE, Evolutionary
Programming Society, Galesia, and the IEE.
IEEE Catalog Number = 01TH8546C,
Library of Congress Number =",
 }
Genetic Programming entries for
Riccardo Poli
Nicholas Freitag McPhee
Citations