DMCA
SEN-R9913 May 31, 1999
BibTeX
@MISC{Issn_sen-r9913may,
author = {Report Sen-R Issn and R. Poli and P. Nordin and T. Fogarty (eds and Issn -x and Mathematisch Centrum (smc and The Dutch Foundation and W. B. Langdon and W. B. Langdon and Riccardo Poli and Peter Nordin and Terry Fogarty},
title = {SEN-R9913 May 31, 1999},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the paper a method that moderates code growth in genetic programming is presented. The addressed problem is symbolic regression. A special mutation operator is used for the simplification of programs. If every individual program in each generation is simplified, then the performance of the genetic programming system is slightly worsened. But if simplification is applied as a mutation operator, more compact solutions of the same or better accuracy can be obtained. 1.
