Sciweavers

3819 search results - page 360 / 764
» Simple Easy Terms
Sort
View
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
16 years 11 days ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 11 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
148
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 11 days ago
Preventing overfitting in GP with canary functions
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 ...
Nate Foreman, Matthew P. Evett
153
Voted
GECCO
2005
Springer
16 years 11 days ago
Evolving agent swarms for clustering and sorting
Social insect societies consist of individuals with simple behavior, yet at the collective level the societies are capable of solving complex tasks. These tasks span a wide range,...
Vegard Hartmann
132
Voted
GECCO
2005
Springer
16 years 11 days 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