Sciweavers

373 search results - page 26 / 75
» On Deterministic Approximation of DNF
Sort
View
FSTTCS
2006
Springer
13 years 11 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
UAI
1994
13 years 9 months ago
Approximation Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
Ann Becker, Dan Geiger
SIAMJO
2008
57views more  SIAMJO 2008»
13 years 7 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
QUESTA
2008
205views more  QUESTA 2008»
13 years 7 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
13 years 2 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu