- author = "Jason M. Daida and Michael E. Samples and Matthew J. Byom",
- title = "Probing for limits to building block mixing with a tunably-difficult problem for genetic programming",
- booktitle = "{GECCO 2005}: Proceedings of the 2005 conference on Genetic and evolutionary computation",
- year = "2005",
- editor = "Hans-Georg Beyer and Una-May O'Reilly and Dirk V. Arnold and Wolfgang Banzhaf and Christian Blum and Eric W. Bonabeau and Erick Cantu-Paz and Dipankar Dasgupta and Kalyanmoy Deb and James A. Foster and Edwin D. {de Jong} and Hod Lipson and Xavier Llora and Spiros Mancoridis and Martin Pelikan and Guenther R. Raidl and Terence Soule and Andy M. Tyrrell and Jean-Paul Watson and Eckart Zitzler",
- volume = "2",
- ISBN = "1-59593-010-8",
- pages = "1713--1720",
- address = "Washington DC, USA",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2005/docs/p1713.pdf",
-
DOI = "
doi:10.1145/1068009.1068295",
- publisher = "ACM Press",
- publisher_address = "New York, NY, 10286-1405, USA",
- month = "25-29 " # jun,
- organisation = "ACM SIGEVO (formerly ISGEC)",
- keywords = "genetic algorithms, genetic programming, building blocks, experimentation, highlander problem, initial populations, performance, tunably-difficult problems, theory",
-
notes = "GECCO-2005 A joint meeting of the fourteenth
international conference on genetic algorithms
(ICGA-2005) and the tenth annual genetic programming
conference (GP-2005).
ACM Order Number 910052",
