75 search results - page 1 / 15 » On the Strength of Size Limits in Linear Genetic Programming |
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
EUROGP
2007
Springer
13 years 11 months ago
2007
Springer
EUROGP
2005
Springer
13 years 10 months ago
2005
Springer
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
IEAAIE
2004
Springer
13 years 10 months ago
2004
Springer
This paper investigates the suitability of linear genetic programming (LGP) technique to model efficient intrusion detection systems, while comparing its performance with artificia...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...