An analysis of diversity of constants of genetic programming

DOI10.1007/3-540-36599-0_38MaRDI QIDQ4418512zbMATH OpenFDO

Authors Conor Ryan, Maarten Keijzer

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/26100404.htm

Mathematics Subject Classification ID

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

Recommendations

• A closer look at mutation in genetic algorithms
• The Max problem revisited: the importance of mutation in genetic programming
• Artificial Evolution
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions

Cited in

(3)

• Bias-variance decomposition in genetic programming
• scientific article; zbMATH DE number 5613810 (Why is no real title available?)
• scientific article; zbMATH DE number 2087204 (Why is no real title available?)

This page was built for publication: An analysis of diversity of constants of genetic programming

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