More on computational effort statistics for genetic programming

DOI10.1007/3-540-36599-0_15MaRDI QIDQ4418473zbMATH OpenFDO

Authors Jens Niehaus, Wolfgang Banzhaf

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

Mathematics Subject Classification ID

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

Recommendations

• An analysis of Koza's computational effort statistic for genetic programming
• Computational complexity, genetic programming, and implications
• Using genetic programming to improve software effort estimation based on general data sets
• Slightly Beyond Turing’s Computability for Studying Genetic Programming
• Statistical and computational tradeoff in genetic algorithm-based estimation

Cited in

(3)

• Solving differential equations with artificial bee colony programming
• Better solutions faster: soft evolution of robust regression models in Pareto genetic programming
• An analysis of Koza's computational effort statistic for genetic programming

This page was built for publication: More on computational effort statistics for genetic programming

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