Theoretical results in genetic programming: the next ten years?

@article{Poli2010TheoreticalRI,
  title={Theoretical results in genetic programming: the next ten years?},
  author={Riccardo Poli and Leonardo Vanneschi and William B. Langdon and Nicholas Freitag McPhee},
  journal={Genetic Programming and Evolvable Machines},
  year={2010},
  volume={11},
  pages={285-320}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 161 references

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

  • J. H. Holland
  • 1992
Highly Influential
17 Excerpts

Covariant parsimony pressure in genetic programming

  • R. Poli, N. F. McPhee
  • Tech. Rep. CES-480, Department of Computing and…
  • 2008
Highly Influential
3 Excerpts

Theory and Practice for Efficient Genetic Programming

  • L. Vanneschi
  • PhD thesis, Faculty of Sciences, University of…
  • 2004
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…