%0 Conference Paper %1 1068310 %A Ondas, Radovan %A Pelikan, Martin %A Sastry, Kumara %B GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation %C Washington DC, USA %D 2005 %E Beyer, Hans-Georg %E O'Reilly, Una-May %E Arnold, Dirk V. %E Banzhaf, Wolfgang %E Blum, Christian %E Bonabeau, Eric W. %E Cantu-Paz, Erick %E Dasgupta, Dipankar %E Deb, Kalyanmoy %E Foster, James A. %E de Jong, Edwin D. %E Lipson, Hod %E Llora, Xavier %E Mancoridis, Spiros %E Pelikan, Martin %E Raidl, Guenther R. %E Soule, Terence %E Tyrrell, Andy M. %E Watson, Jean-Paul %E Zitzler, Eckart %I ACM Press %K PIPE, Poster, algorithms, genetic order performance, problem, programming, scalability trap %P 1785--1786 %T Scalability of genetic programming and probabilistic incremental program evolution %U http://doi.acm.org/10.1145/1068009.1068310 %V 2 %X 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. %@ 1-59593-010-8

@inproceedings{1068310, 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.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Washington DC, USA}, author = {Ondas, Radovan and Pelikan, Martin and Sastry, Kumara}, biburl = {https://www.bibsonomy.org/bibtex/28c059e2bccd4dc2893f44be118b574a0/brazovayeye}, booktitle = {{GECCO 2005}: Proceedings of the 2005 conference on Genetic and evolutionary computation}, editor = {Beyer, Hans-Georg and O'Reilly, Una-May and Arnold, Dirk V. and Banzhaf, Wolfgang and Blum, Christian and Bonabeau, Eric W. and Cantu-Paz, Erick and Dasgupta, Dipankar and Deb, Kalyanmoy and Foster, James A. and {de Jong}, Edwin D. and Lipson, Hod and Llora, Xavier and Mancoridis, Spiros and Pelikan, Martin and Raidl, Guenther R. and Soule, Terence and Tyrrell, Andy M. and Watson, Jean-Paul and Zitzler, Eckart}, interhash = {6b00bcd00e24f00b1217f274c75d1d09}, intrahash = {8c059e2bccd4dc2893f44be118b574a0}, isbn = {1-59593-010-8}, keywords = {PIPE, Poster, algorithms, genetic order performance, problem, programming, scalability trap}, month = {25-29 June}, 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}}, organisation = {ACM SIGEVO (formerly ISGEC)}, pages = {1785--1786}, publisher = {ACM Press}, publisher_address = {New York, NY, 10286-1405, USA}, timestamp = {2008-06-19T17:48:54.000+0200}, title = {Scalability of genetic programming and probabilistic incremental program evolution}, url = {http://doi.acm.org/10.1145/1068009.1068310}, volume = 2, year = 2005 }