Sciweavers

49 search results - page 2 / 10
» Characterizing a Tunably Difficult Problem in Genetic Progra...
Sort
View
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 9 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GPEM
2006
97views more  GPEM 2006»
13 years 5 months ago
Evolving recursive programs by using adaptive grammar based genetic programming
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
Man Wong
EVOW
1994
Springer
13 years 9 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
ICIP
2002
IEEE
14 years 7 months ago
Color printer characterization in MATLAB
Many researchers are working on various aspects of color imaging. However, it is apparent from the papers published that it is difficult for many of them to produce high quality c...
Michael J. Vrhel, H. Joel Trussell
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
13 years 9 months ago
GP+Echo+Subsumption = Improved Problem Solving
Real-time, adaptive control is a difficult problem that can be addressed by EC architectures. We are interested in incorporating into an EC architecture some of the features that ...
William F. Punch, W. M. Rand