36 search results - page 7 / 8 » A GP neutral function for the artificial ANT problem |
GECCO
2007
Springer
13 years 9 months ago
2007
Springer
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...
CEC
2011
IEEE
12 years 5 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In a previous work we have proposed a hybrid Particle Swarm Optimisation/Ant Colony Optimisation (PSO/ACO) algorithm for the discovery of classification rules, in the context of d...
EUROGP
1998
Springer
13 years 9 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...