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...
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
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...
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...
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...