An analysis of Koza's computational effort statistic for genetic programming

DOI10.1007/3-540-45984-7_18MaRDI QIDQ4737867zbMATH OpenFDO

Authors Steffen Christensen, Franz Oppacher

Publication date 11 August 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/2278/22780182.htm

Mathematics Subject Classification ID

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

Recommendations

• More on computational effort statistics for genetic programming
• Computational complexity, genetic programming, and implications
• AI*IA 2005: Advances in Artificial Intelligence
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• A methodology for the statistical characterization of genetic algorithms

Cited in

(1)

• More on computational effort statistics for genetic programming

This page was built for publication: An analysis of Koza's computational effort statistic for genetic programming

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