Sciweavers

403 search results - page 11 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
TITS
2008
96views more  TITS 2008»
13 years 9 months ago
A Sampling Theorem Approach to Traffic Sensor Optimization
Abstract--With the objective of minimizing the total cost, which includes both sensor and congestion costs, the authors adopted a novel sampling theorem approach to address the pro...
Woei Ling Leow, Daiheng Ni, Hossein Pishro-Nik
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 9 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 9 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
DAGSTUHL
2007
13 years 11 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
SAGA
2009
Springer
14 years 4 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel