50 search results - page 6 / 10 » Quadratic Bloat in Genetic Programming |
GPEM
2002
13 years 7 months ago
2002
Abstract. This research examines the cause of code growth (bloat) in genetic programming (GP). Currently there are three hypothesized causes of code growth in GP: protection, drift...
EUROGP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...