Removal bias: A new cause of code growth in tree based evolutionary programming

62Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new cause of code growth, termed removal bias. We show that growth due to removal bias can be expected to occur whenever operations which remove and replace a variable sized section of code, e.g. crossover or subtree mutation, are used in an evolutionary paradigm. Two forms of non-destructive crossover are used to examine the causes of code growth. Results support the protective value of inviable code and removal bias as two distinct causes of code growth. Both causes of code growth are shown to exist in at least two different problems.

Cite

CITATION STYLE

APA

Soule, T., & Foster, J. A. (1998). Removal bias: A new cause of code growth in tree based evolutionary programming. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (pp. 781–786). IEEE. https://doi.org/10.1109/icec.1998.700151

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