Dynamic maximum tree depth

DOI10.1007/3-540-45110-2_69MaRDI QIDQ4449795zbMATH OpenFDO

Authors Sara Silva, Jonas S. Almeida

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241776.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Reducing bloat in genetic programming
• Parsimony pressure made easy: solving the problem of bloat in GP
• Efficient tree traversal to reduce code growth in tree-based genetic programming
• scientific article; zbMATH DE number 1872150
• Uniform subtree mutation

Cited in

(1)

• Neutral offspring controlling operators in genetic programming

This page was built for publication: Dynamic maximum tree depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449795)