A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II
2003
Evolutionary Computation
This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system, introduced in Part I, and on the notion of a variable-arity hyperschema,
doi:10.1162/106365603766646825
pmid:12875668
fatcat:6t7tbuifazhrrj347okpsmnj6u