Sciweavers

3913 search results - page 619 / 783
» complexity 2006
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 9 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 9 months ago
Analysis of the difficulty of learning goal-scoring behaviour for robot soccer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
Jeff Riley, Victor Ciesielski
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 9 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 9 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
15 years 9 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt