1130 search results - page 67 / 226 » Bandit-Based Genetic Programming |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program. Beginni...
111
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
15 years 3 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
EUROGP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Types have been introduced to Genetic Programming (GP) by researchers with different motivation. We present the concept of types in GP and introduce a typed GP system, Po...
GECCO
2006
Springer
15 years 1 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...