Theoretical Results in Genetic Programming: The next ten years?

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

@Article{poli:2010:GPEM,
  author =       "Riccardo Poli and Leonardo Vanneschi and 
                 William B. Langdon and Nicholas Freitag McPhee",
  title =        "Theoretical Results in Genetic Programming: The next
                 ten years?",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2010",
  volume =       "11",
  number =       "3/4",
  pages =        "285--320",
  month =        sep,
  note =         "Tenth Anniversary Issue: Progress in Genetic
                 Programming and Evolvable Machines",
  keywords =     "genetic algorithms, genetic programming, Theory,
                 Challenges, Open problems",
  ISSN =         "1389-2576",
  DOI =          "doi:10.1007/s10710-010-9110-5",
  size =         "36 pages",
  abstract =     "We consider the theoretical results in GP so far and
                 prospective areas for the future. We begin by reviewing
                 the state of the art in genetic programming (GP) theory
                 including: schema theories, Markov chain models, the
                 distribution of functionality in program search spaces,
                 the problem of bloat, the applicability of the
                 no-free-lunch theory to GP, and how we can estimate the
                 difficulty of problems before actually running the
                 system. We then look at how each of these areas might
                 develop in the next decade, considering also new
                 possible avenues for theory, the challenges ahead and
                 the open issues.",
}

Genetic Programming entries for Riccardo Poli Leonardo Vanneschi William B Langdon Nicholas Freitag McPhee

Citations