36 search results - page 1 / 8 » A GP neutral function for the artificial ANT problem |
GECCO
2007
Springer
13 years 8 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
FOGA
2011
12 years 8 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...