scientific article; zbMATH DE number 2040717

MaRDI QIDQ4449796zbMATH OpenFDO

Authors Leonardo Vanneschi, Marco Tomassini, Manuel Clergue, Philippe Collard

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241788.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

• AI*IA 2005: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 1962077
• What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
• Investigating problem hardness of real life applications
• A study of the neutrality of Boolean function landscapes in genetic programming

Cited in

(7)

• Investigating problem hardness of real life applications
• A study of the neutrality of Boolean function landscapes in genetic programming
• scientific article; zbMATH DE number 1962077 (Why is no real title available?)
• scientific article; zbMATH DE number 2040710 (Why is no real title available?)
• What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
• AI*IA 2005: Advances in Artificial Intelligence
• Practical performance models of algorithms in evolutionary program induction and other domains

This page was built for publication:

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