%0 Conference Paper %1 parent:2005:CEC %A Parent, Johan %A Nowe, Ann %A Steenhaut, Kris %A Defaweux, Anne %B Proceedings of the 2005 IEEE Congress on Evolutionary Computation %C Edinburgh, UK %D 2005 %E Corne, David %E Michalewicz, Zbigniew %E Dorigo, Marco %E Eiben, Gusz %E Fogel, David %E Fonseca, Carlos %E Greenwood, Garrison %E Chen, Tan Kay %E Raidl, Guenther %E Zalzala, Ali %E Lucas, Simon %E Paechter, Ben %E Willies, Jennifier %E Guervos, Juan J. Merelo %E Eberbach, Eugene %E McKay, Bob %E Channon, Alastair %E Tiwari, Ashutosh %E Volkert, L. Gwenn %E Ashlock, Dan %E Schoenauer, Marc %I IEEE Press %K algorithms, genetic programming %P 1164--1171 %T Linear Genetic Programming using a compressed genotype representation %U http://parallel.vub.ac.be/~johan/Papers/cec05_final.pdf %V 2 %X a modularisation strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is to protect building blocks and is in other words a form of learning linkage. The compression of the genotype provides both a protection mechanism and a form of genetic code reuse. This paper presents results for synthetic genetic algorithm (GA) reference problems like SEQ and OneMax as well as several standard GP problems. These include a real world application of GP to data compression. Results show that despite the fact that the compression substrings assumes a tight linkage between alleles, this approach improves the search process. %@ 0-7803-9363-5

@inproceedings{parent:2005:CEC, abstract = {a modularisation strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is to protect building blocks and is in other words a form of learning linkage. The compression of the genotype provides both a protection mechanism and a form of genetic code reuse. This paper presents results for synthetic genetic algorithm (GA) reference problems like SEQ and OneMax as well as several standard GP problems. These include a real world application of GP to data compression. Results show that despite the fact that the compression substrings assumes a tight linkage between alleles, this approach improves the search process.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Edinburgh, UK}, author = {Parent, Johan and Nowe, Ann and Steenhaut, Kris and Defaweux, Anne}, biburl = {https://www.bibsonomy.org/bibtex/2db5797dc4dbbebab3562669ad7c402de/brazovayeye}, booktitle = {Proceedings of the 2005 IEEE Congress on Evolutionary Computation}, editor = {Corne, David and Michalewicz, Zbigniew and Dorigo, Marco and Eiben, Gusz and Fogel, David and Fonseca, Carlos and Greenwood, Garrison and Chen, Tan Kay and Raidl, Guenther and Zalzala, Ali and Lucas, Simon and Paechter, Ben and Willies, Jennifier and Guervos, Juan J. Merelo and Eberbach, Eugene and McKay, Bob and Channon, Alastair and Tiwari, Ashutosh and Volkert, L. Gwenn and Ashlock, Dan and Schoenauer, Marc}, interhash = {c40786d1c400ef8ff859c3ca2fd3c1d7}, intrahash = {db5797dc4dbbebab3562669ad7c402de}, isbn = {0-7803-9363-5}, keywords = {algorithms, genetic programming}, month = {2-5 September}, notes = {CEC2005 - A joint meeting of the IEEE, the IEE, and the EPS.}, organisation = {IEEE Computational Intelligence Society, Institution of Electrical Engineers (IEE), Evolutionary Programming Society (EPS)}, pages = {1164--1171}, publisher = {IEEE Press}, publisher_address = {445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA}, timestamp = {2008-06-19T17:49:14.000+0200}, title = {Linear Genetic Programming using a compressed genotype representation}, url = {http://parallel.vub.ac.be/~johan/Papers/cec05_final.pdf}, volume = 2, year = 2005 }