Jump to content

Linear genetic programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Riccardopoli (talk | contribs) at 14:26, 24 April 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
"Linear genetic programming" is unrelated to "linear programming".

Linear Genetic Programming (LGP) is a particular subset of genetic programming wherein computer programs in population are represented as a sequence of instructions from imperative programming language or machine language. The graph-based data flow that results from a multiple usage of register contents and the existence of structurally noneffective code (introns) are two main differences to more common tree-based genetic programming (TGP) variant.[1] [2][3]

People interested in LGP

  • Wolfgang Banzhaf
  • Peter Nordin
  • Markus Brameier
  • Ashley Reid-Montanaro
  • Frank Francone

Notes

  1. ^ Brameier, M.: "On linear genetic programming", Dortmund, 2003
  2. ^ W. Banzhaf, P. Nordin, R. Keller, F. Francone, "Genetic Programming – An Introduction. On the Automatic Evolution of Computer Programs and its Application", Morgan Kaufmann, Heidelberg/San Francisco, 1998
  3. ^ Poli, R., Langdon, W. B., McPhee, N. F. (2008). A Field Guide to Genetic Programming. Lulu.com, freely available from the internet. ISBN 978-1-4092-0073-4.{{cite book}}: CS1 maint: multiple names: authors list (link)
Stub icon

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Linear_genetic_programming&oldid=207864262"