Sciweavers

8 search results - page 1 / 2
» Large Populations Are Not Always The Best Choice In Genetic ...
Sort
View
GECCO
1999
Springer
13 years 8 months ago
Large Populations Are Not Always The Best Choice In Genetic Programming
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Matthias Fuchs
CEC
2005
IEEE
13 years 10 months ago
Single parent genetic programming
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
Wendy Ashlock, Dan Ashlock
ICRA
1998
IEEE
147views Robotics» more  ICRA 1998»
13 years 8 months ago
Biologically Inspired Robot Grasping Using Genetic Programming
This paper describes the innovative use of a genetic algorithm to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a `best&#...
Jaime J. Fernandez, Ian D. Walker
ISBI
2008
IEEE
14 years 5 months ago
Best individual template selection from deformation tensor minimization
We study the influence of the choice of template in tensorbased morphometry. Using 3D brain MR images from 10 monozygotic twin pairs, we defined a tensor-based distance in the log...
Natasha Lepore, Caroline A. Brun, Yi-Yu Chou, Agat...
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
13 years 10 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon