Sciweavers

928 search results - page 133 / 186
» Evolutionary algorithms and matroid optimization problems
Sort
View
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
13 years 11 months ago
Adaptive evolution: an efficient heuristic for global optimization
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...
Francisco Viveros Jiménez, Efrén Mez...
CEC
2010
IEEE
13 years 9 months ago
A mixed strategy for Evolutionary Programming based on local fitness landscape
The performance of Evolutionary Programming (EP) is affected by many factors (e.g. mutation operators and selection strategies). Although the conventional approach with Gaussian mu...
Liang Shen, Jun He
RECOMB
2004
Springer
14 years 8 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
SEAL
2010
Springer
13 years 5 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf