- author = "Radovan Ondas and Martin Pelikan and Kumara Sastry",
- title = "Scalability of genetic programming and probabilistic incremental program evolution",
- 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 = "1785--1786",
- address = "Washington DC, USA",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2005/docs/p1785.pdf",
-
DOI = "
doi:10.1145/1068009.1068310",
-
URL = "
http://arxiv.org/abs/cs/0502029",
- 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, Poster, order problem, performance, PIPE, trap problem, scalability",
- abstract = "The purpose of this poster is to show the scalability of standard GP and PIPE on two decomposable GP problems: ORDER and TRAP [6]. The two algorithms perform as expected and they solve ORDER scalably while failing to scale up on TRAP. Additionally, the poster studies the effects of introducing unnecessary and irrelevant primitives.",
-
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
http://arxiv.org/abs/cs.NE/0502029 suggests may be available as arXiv Computer Science, abstract cs.NE/0502029 Cf also \cite{ondas:2005:WSC}.
{"}scalability of standard GP and PIPE on two decomposable GP problems: ORDER and TRAP{"}
ORDER both GP and PIPE scale as something like n**3. While both are exponential in problem size for trap. Additional (unneeded) terminals make little difference.
See http://arxiv.org/abs/cs/0502029 \cite{oai:arXiv.org:cs/0502029}",
