Linear-tree GP and its comparison with other GP structures
From MaRDI portal
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)
Recommendations
- scientific article; zbMATH DE number 2087183
- scientific article; zbMATH DE number 1156666
- scientific article; zbMATH DE number 2034576
- scientific article; zbMATH DE number 3858831
- On the power of the linear array architecture for performing tree- structured computations
- Near-optimal linear decision trees for \(k\)-SUM and related problems
- Lower bounds on probabilistic linear decision trees
- Near-optimal linear decision trees for k-SUM and related problems
Cited in
(8)- An indirect block-oriented representation for genetic programming
- Structural versus evaluation based solutions similarity in genetic programming based system identification
- Evolving choice structures for genetic programming
- scientific article; zbMATH DE number 1962052 (Why is no real title available?)
- scientific article; zbMATH DE number 2040706 (Why is no real title available?)
- Point-tree structure genetic programming method for discontinuous function’s regression
- scientific article; zbMATH DE number 2087183 (Why is no real title available?)
- A comparison of several linear genetic programming techniques
This page was built for publication: Linear-tree GP and its comparison with other GP structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768648)
