Sciweavers

2126 search results - page 11 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
EMO
2005
Springer
110views Optimization» more  EMO 2005»
15 years 3 months ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
15 years 4 months ago
SNDL-MOEA: stored non-domination level MOEA
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
15 years 4 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
ICCV
2009
IEEE
16 years 2 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
GECCO
2008
Springer
153views Optimization» more  GECCO 2008»
14 years 11 months ago
G-Metric: an M-ary quality indicator for the evaluation of non-dominated sets
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
Giovanni Lizárraga Lizárraga, Arturo...