The root causes of code growth in genetic programming

DOI10.1007/3-540-36599-0_42MaRDI QIDQ4418517zbMATH OpenFDO

Authors Matthew J. Streeter

Publication date 10 August 2003

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/2610/26100443.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1869570
• Artificial Evolution
• Exons and code growth in genetic programming
• scientific article; zbMATH DE number 1944897
• Reducing bloat in genetic programming

Cited in

(13)

• Efficient tree traversal to reduce code growth in tree-based genetic programming
• Neutral offspring controlling operators in genetic programming
• Shorter fitness preserving genetic programs
• Genetic programming: A review of some concerns
• Parsimony pressure made easy: solving the problem of bloat in GP
• scientific article; zbMATH DE number 1944897 (Why is no real title available?)
• Neutral variations cause bloat in linear GP
• Introducing a Perl genetic programming system -- and can meta-evolution solve the bloat problem?
• Reducing bloat in genetic programming
• Exons and code growth in genetic programming
• scientific article; zbMATH DE number 1869979 (Why is no real title available?)
• scientific article; zbMATH DE number 1869570 (Why is no real title available?)
• Artificial Evolution

This page was built for publication: The root causes of code growth in genetic programming

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