Sciweavers

82 search results - page 1 / 17
» Lower Bounds for the Smoothed Number of Pareto optimal Solut...
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 1 months ago
Lower Bounds for the Smoothed Number of Pareto optimal Solutions
In 2009, R
Tobias Brunsch, Heiko Roeglin
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 6 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ALT
2002
Springer
14 years 1 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
MP
2007
95views more  MP 2007»
13 years 4 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking