416 search results - page 54 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
CISS
2007
IEEE
13 years 7 months ago
2007
IEEE
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...