scientific article; zbMATH DE number 2040717
From MaRDI portal
Publication:4449796
zbMATH Open1038.68905MaRDI QIDQ4449796FDOQ4449796
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
Title of this publication is not available (Why is that?)
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
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (7)
- Title not available (Why is that?)
- What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
- Title not available (Why is that?)
- Investigating problem hardness of real life applications
- A study of the neutrality of Boolean function landscapes 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)
