416 search results - page 38 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
128
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
139
click to vote
COR
2007
15 years 2 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
148
Voted
JAIR
2008
15 years 2 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
143
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
121
click to vote
ECCC
2000
15 years 2 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...