Linear genetic programming

From Wikipedia, the free encyclopedia

You have new messages (last change).
"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]

[edit] People interested in LGP

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

[edit] 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

[edit] External links

Comp Sci logo This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../l/i/n/Linear_genetic_programming.html"
In other languages