The following pages link to (Q3549602):
Displayed 14 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- (Q5009622) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- Sensor Scheduling for Space Object Tracking and Collision Alert (Q5326890) (← links)
- ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
- (Q5743496) (← links)
- (Q5875506) (← links)
- Stochastic graph exploration with limited resources (Q6176558) (← links)