%0 Conference Paper %1 andre:1996:introns %A Andre, David %A Teller, Astro %B Genetic Programming 1996: Proceedings of the First Annual Conference %C Stanford University, CA, USA %D 1996 %E Koza, John R. %E Goldberg, David E. %E Fogel, David B. %E Riolo, Rick L. %I MIT Press %K algorithms, genetic programming %P 12--20 %T A Study in Program Response and the Negative Effects of Introns in Genetic Programming %U http://www.cs.cmu.edu/afs/cs/usr/astro/mosaic/TellerGP96/TellerGP96.html %X The standard method of obtaining a response in tree-based genetic programming is to take the value returned by the root node. In non-tree representations, alternate methods have been explored. One alternative is to treat a specific location in indexed memory as the response value when the program terminates. The purpose of this paper is to explore the applicability of this technique to tree-structured programs and to explore the intron effects that these studies bring to light. This paper's experimental results support the finding that this memory-based program response technique is an improvement for some, but not all, problems. In addition, this paper's experimental results support the finding that, contrary to past research and speculation, the addition or even facilitation of introns can seriously degrade the search performance of genetic programming.

@inproceedings{andre:1996:introns, abstract = {The standard method of obtaining a response in tree-based genetic programming is to take the value returned by the root node. In non-tree representations, alternate methods have been explored. One alternative is to treat a specific location in indexed memory as the response value when the program terminates. The purpose of this paper is to explore the applicability of this technique to tree-structured programs and to explore the intron effects that these studies bring to light. This paper's experimental results support the finding that this memory-based program response technique is an improvement for some, but not all, problems. In addition, this paper's experimental results support the finding that, contrary to past research and speculation, the addition or even facilitation of introns can seriously degrade the search performance of genetic programming.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Stanford University, CA, USA}, author = {Andre, David and Teller, Astro}, biburl = {https://www.bibsonomy.org/bibtex/2f31b37f6d74d83fe682b7893bb9e73f1/brazovayeye}, booktitle = {Genetic Programming 1996: Proceedings of the First Annual Conference}, editor = {Koza, John R. and Goldberg, David E. and Fogel, David B. and Riolo, Rick L.}, interhash = {b053a2556ae7f26188a5cd34888872ef}, intrahash = {f31b37f6d74d83fe682b7893bb9e73f1}, keywords = {algorithms, genetic programming}, month = {28--31 July}, notes = {GP-96 html version available from http://www.cs.cmu.edu/~astro/}, pages = {12--20}, publisher = {MIT Press}, size = {9 pages}, timestamp = {2008-06-19T17:35:43.000+0200}, title = {A Study in Program Response and the Negative Effects of Introns in Genetic Programming}, url = {http://www.cs.cmu.edu/afs/cs/usr/astro/mosaic/TellerGP96/TellerGP96.html}, year = 1996 }