Structure of the Genetic Programming Search Space

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

@TechReport{langdon:2002:dagstuhl,

• title = "Structure of the Genetic Programming Search Space",
• author = "William B. Langdon",
• editor = "Hans-Georg Beyer and Ken {De Jong} and Colin Reeves and Ingo Wegener",
• booktitle = "Theory of Evolutionary Algorithms",
• institution = "Dagstuhl",
• year = "2002",
• type = "Report",
• number = "330",
• address = "Germany",
• month = "13-18 " # jan,
• pages = "12",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://www.dagstuhl.de/files/Reports/02/02031.pdf",
• URL = "http://www.dagstuhl.de/files/Reports/02/02031.ps.gz",
• abstract = "It is known that the fitness distribution of programs tends to a limit as they get bigger. We use Markov chain convergence theorems to give both upper and lower bounds on program size needed for convergence. Results are presented for four types of computer models. The bounds on the length of random programs needed to converge depends upon the size of memory N. Bounds are exponential in N, N log N and smaller, depending on the model.",
• notes = "Seminar No. 02031. See also \cite{langdon:2002:crlp}",

}

Genetic Programming entries for William B Langdon

Citations