Sciweavers

182 search results - page 27 / 37
» Morphing methods in evolutionary design optimization
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 12 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
COR
2010
150views more  COR 2010»
13 years 11 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
TEC
2008
100views more  TEC 2008»
13 years 10 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 4 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 3 months ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo