- author = "R. Poli and W. B. Langdon and Stephen Dignum",
- title = "On the Limiting Distribution of Program Sizes in Tree-based Genetic Programming",
- institution = "Department of Computer Science, University of Essex",
- year = "2006",
- type = "Technical Report",
- number = "CSM-464",
- month = dec,
- ISSN = "1744-8050",
- keywords = "genetic algorithms, genetic programming",
-
URL = "
http://cswww.essex.ac.uk/technical-reports/2006/csm464.pdf",
-
abstract = "We provide strong theoretical and experimental
evidence that standard sub-tree crossover with uniform
selection of crossover points pushes a population of
a-ary GP trees towards a distribution of tree sizes of
the form:
Pr{n} = (1 - ap)C(an + 1,n) (1-p)**(a-1)n+1 p**n
where n is the number of internal nodes in a tree and pa is a constant. This result generalises the result previously reported in \cite{poli:2001:EuroGP_exact}, \cite{mcphee:2001:astamsbgplr}, \cite{Rowe01}, \cite{poli03:ECJ_gener_schem_part_I} \cite{poli03:ECJ_gener_schem_part_II} for the case a=1.",
- notes = "see \cite{poli:2007:eurogp}",
- size = "12 pages",
