Jump to content

Linear tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by TheAMmollusc (talk | contribs) at 10:58, 20 February 2012 (Unsuccessful de-orphan attempt, WikiProject Orphanage: You can help! but at least a merge proposal has recently been put in place). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

References

Foundations of Genetic Programming.

P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

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