Linear tree

From Wikipedia, the free encyclopedia

 This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (November 2006)

In genetic programming (GP) a linear tree is a program composed of a variable number of unary functions and a single terminal. Note linear tree GP differs from bit string genetic algorithms since a population may contain programs of different lengths and there may be more than two types of functions or more than two types of terminals.

[edit] References

Foundations of Genetic Programming.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.