Sciweavers

255 search results - page 35 / 51
» gecco 2006
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 1 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 1 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
86
Voted
GECCO
2006
Springer
172views Optimization» more  GECCO 2006»
15 years 1 months ago
Multi-objective optimisation of the protein-ligand docking problem in drug discovery
The pharmaceutical industry is facing an ever-increasing demand to discover novel drugs that are more effective and safer than existing ones. The industry faces huge problem in im...
A. Oduguwa, A. Tiwari, S. Fiorentino, R. Roy
73
Voted
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 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
139views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule