- author = "W. B. Langdon",
- title = "How many Good Programs are there? {H}ow Long are they?",
- booktitle = "Foundations of Genetic Algorithms {VII}",
- year = "2002",
- editor = "Kenneth A. {De Jong} and Riccardo Poli and Jonathan E. Rowe",
- pages = "183--202",
- address = "Torremolinos, Spain",
- publisher_address = "San Francisco, CA, USA",
- month = "4-6 " # sep,
- publisher = "Morgan Kaufmann",
- note = "Published 2003",
- keywords = "genetic algorithms, genetic programming, Gambler's ruin",
- ISBN = "0-12-208155-2",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_foga2002.pdf",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_foga2002.ps.gz",
-
abstract = "We model the distribution of functions implemented by
non-recursive programs, similar to linear genetic
programming (GP). Most functions are constants, the
remainder are mostly parsimonious. The effect of ad-hoc
rules on GP are described and new heuristics are
proposed.
Bounds on how long programs need to be before the distribution of their functionality is close to its limiting distribution are provided in general and for average computers.
Results for average computers and a model like genetic programming are experimentally tested.",
- notes = "Workshop in September 2002, published 2003",
