118 search results - page 12 / 24 » Fitness Clouds and Problem Hardness in Genetic Programming |
CEC
2009
IEEE
14 years 2 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...
EVOW
2003
Springer
14 years 28 days ago
2003
Springer
This paper describes a domain independent approach to the use of genetic programming for object detection problems. Rather than using raw pixels or high level domain specific feat...
ACSW
2004
13 years 9 months ago
2004
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...