Sciweavers

882 search results - page 7 / 177
» On the Application of Evolutionary Algorithms to the Consens...
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 9 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
PPSN
2010
Springer
13 years 6 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
EMO
2001
Springer
225views Optimization» more  EMO 2001»
14 years 24 days ago
Application of Multiobjective Evolutionary Algorithms for Dose Optimization Problems in Brachytherapy
In High Dose Rate (HDR) brachytherapy the conventional dose optimization algorithms consider the multiple objectives in form of an aggregate function which combines individual obj...
Michael Lahanas, Natasa Milickovic, Dimos Baltas, ...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 1 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener