A Survey of Problem Difficulty in Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{conf/aiia/VanneschiTCC05,

• title = "A Survey of Problem Difficulty in Genetic Programming",
• author = "Leonardo Vanneschi and Marco Tomassini and Philippe Collard and Manuel Clergue",
• year = "2005",
• pages = "66--77",
• editor = "Stefania Bandini and Sara Manzoni",
• series = "Lecture Notes in Computer Science",
• volume = "3673",
• booktitle = "AI*IA 2005: Advances in Artificial Intelligence, 9th Congress of the Italian Association for Artificial Intelligence, Proceedings",
• address = "Milan, Italy",
• month = sep # " 21-23",
• organisation = "Italian Association for Artificial Intelligence",
• publisher = "Springer",
• bibdate = "2005-10-26",
• bibsource = "DBLP, http://dblp.uni-trier.de/db/conf/aiia/aiia2005.html#VanneschiTCC05",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "3-540-29041-9",
• bibsource = "DBLP, http://dblp.uni-trier.de",
• DOI = "doi:10.1007/11558590_7",
• size = "12 pages",
• abstract = "a study of fitness distance correlation and negative slope coefficient as measures of problem hardness for genetic programming. Advantages and drawbacks of both these measures are presented both from a theoretical and empirical point of view. Experiments have been performed on a set of well-known hand-tailored problems and 'real-life-like' GP benchmarks.",

}

Genetic Programming entries for Leonardo Vanneschi Marco Tomassini Philippe Collard Manuel Clergue

Citations