Linear tree
From Wikipedia, the free encyclopedia
|
|
It has been suggested that this article or section be merged into Linear genetic programming. (Discuss) Proposed since January 2012. |
| This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions may be available. (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.
| P ≟ NP | This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it. |