Skip to main content
Conference Proceedings

Exons and code growth in genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2278 142-151
DOI: 10.1007/3-540-45984-7_14
25Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Current theories regarding code growth (bloat) in genetic programming focus on the presence and growth of introns. In this paper we show for the first time that code growth can occur, albeit quite slowly, even in code that has a significant impact on fitness.

Cite

CITATION STYLE

APA

Soule, T. (2002). Exons and code growth in genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2278, pp. 142–151). Springer Verlag. https://doi.org/10.1007/3-540-45984-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free