General Schema theory for genetic programming with subtree-swapping crossover: Part I

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

@Article{poli03:ECJ_gener_schem_part_I,
  author =       "Riccardo Poli and Nicholas Freitag McPhee",
  title =        "General Schema theory for genetic programming with
                 subtree-swapping crossover: {Part I}",
  journal =      "Evolutionary Computation",
  year =         "2003",
  volume =       "11",
  number =       "1",
  month =        mar,
  pages =        "53--66",
  keywords =     "genetic algorithms, genetic programming, Node
                 Reference Systems, Models of Crossover, Schema Theory",
  URL =          "http://cswww.essex.ac.uk/staff/rpoli/papers/ecj2003partI.pdf",
  DOI =          "doi:10.1162/106365603321829005",
  abstract =     "This is the first part of a two-part paper which
                 introduces a general schema theory for genetic
                 programming (GP) with subtree-swapping crossover. The
                 theory is based on a Cartesian node reference system
                 which makes it possible to describe programs as
                 functions over the space and allows one to model the
                 process of selection of the crossover points of
                 subtree-swapping crossovers as a probability
                 distribution over In Part I, we present these notions
                 and models and show how they can be used to calculate
                 useful quantities. In Part II we will show how this
                 machinery, when integrated with other definitions, such
                 as that of variable-arity hyperschema, can be used to
                 construct a general and exact schema theory for the
                 most commonly used types of GP.",
  notes =        "see also \cite{poli03:ECJ_gener_schem_part_II}",
}

Genetic Programming entries for Riccardo Poli Nicholas Freitag McPhee

Citations