Exact GP Schema Theory for Headless Chicken Crossover and Subtree Mutation

Created by W.Langdon from gp-bibliography.bib Revision:1.4496

  author =       "Riccardo Poli and Nicholas Freitag McPhee",
  title =        "Exact GP Schema Theory for Headless Chicken Crossover
                 and Subtree Mutation",
  institution =  "University of Birmingham, School of Computer Science",
  number =       "CSRP-00-23",
  month =        dec,
  year =         "2000",
  keywords =     "genetic algorithms, genetic programming",
  email =        "R.Poli@cs.bham.ac.uk, N.F.McPhee@cs.bham.ac.uk",
  file =         "/2000/CSRP-00-23.ps.gz",
  URL =          "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-23.ps.gz",
  abstract =     "In this paper a new general 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. The theory includes four main results:
                 microscopic schema theorems for both headless chicken
                 crossover and subtree mutation, and two corresponding
                 macroscopic theorems. The microscopic versions are
                 applicable to headless chicken crossovers and subtree
                 mutation operators. The macroscopic versions are valid
                 for slightly more restricted sets of headless chicken
                 and mutation operators in which the probability of
                 selecting the crossover/mutation point(s) depends only
                 on the size and shape of the parent program(s). In the
                 paper we provide examples which show how the theory can
                 be specialised to specific operators.",

Genetic Programming entries for Riccardo Poli Nicholas Freitag McPhee