Sciweavers

2174 search results - page 355 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 11 months ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
15 years 11 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 11 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison
GECCO
2010
Springer
150views Optimization» more  GECCO 2010»
15 years 11 months ago
Object-level recombination of commodity applications
This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object file...
Blair Foster, Anil Somayaji
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 10 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...