Sciweavers

1129 search results - page 169 / 226
» Genetic Programming
Sort
View
GECCO
2005
Springer
15 years 5 months ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
15 years 5 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong
GECCO
2005
Springer
114views Optimization» more  GECCO 2005»
15 years 5 months ago
Exploiting disruption aversion to control code bloat
The authors employ multiple crossovers as a novel natural extension to crossovers as a mixing operator. They use this as a framework to explore the ideas of code growth. Empirical...
Jason Stevens, Robert B. Heckendorn, Terence Soule
ACIVS
2009
Springer
15 years 4 months ago
Engineering of Computer Vision Algorithms Using Evolutionary Algorithms
Abstract. Computer vision algorithms are currently developed by looking up the available operators from the literature and then arranging those operators such that the desired task...
Marc Ebner
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
15 years 4 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert