416 search results - page 42 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
120
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
123
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
138
click to vote
UAI
1998
15 years 4 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
157
click to vote
ICDCS
1997
IEEE
15 years 7 months ago
1997
IEEE
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
123
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...