Sciweavers

403 search results - page 2 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 7 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
ICML
2010
IEEE
13 years 8 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
MVA
2007
129views Computer Vision» more  MVA 2007»
13 years 8 months ago
Multi Human Trajectory Estimation Using Stochastic Sampling and Its Application to Meeting Recognition
In this paper we present a stochastic sampling approach to estimate multiple human trajectory in the meeting. The algorithm is formalized as a energy minimization problem based on...
Yosuke Matsusaka, Hideki Asoh, Futoshi Asano
JAMDS
2000
90views more  JAMDS 2000»
13 years 7 months ago
Stratified filtered sampling in stochastic optimization
We develop a methodology for evaluating a decision strategy generated by a stochastic optimization model. The methodology is based on a pilot study in which we estimate the distri...
Robert Rush, John M. Mulvey, John E. Mitchell, Tho...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...