Sciweavers

118 search results - page 1 / 24
» Fitness Clouds and Problem Hardness in Genetic Programming
Sort
View
GECCO
2004
Springer
13 years 10 months ago
Fitness Clouds and Problem Hardness in Genetic Programming
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
Leonardo Vanneschi, Manuel Clergue, Philippe Colla...
GECCO
2000
Springer
178views Optimization» more  GECCO 2000»
13 years 8 months ago
Fitness Sharing in Genetic Programming
This paper investigates fitness sharing in genetic programming. Implicit fitness sharing is applied to populations of programs. Three treatments are compared: raw fitness, pure fi...
Robert I. McKay
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
13 years 10 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
FOGA
1990
13 years 5 months ago
A Hierarchical Approach to Learning the Boolean Multiplexer Function
This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
John R. Koza
GECCO
2003
Springer
13 years 9 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene