Sciweavers

502 search results - page 47 / 101
» Monotone Approximation of Decision Problems
Sort
View
NETWORKS
2010
14 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
EOR
2007
364views more  EOR 2007»
14 years 9 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
103
Voted
CORR
2011
Springer
230views Education» more  CORR 2011»
14 years 4 months ago
Computational Rationalization: The Inverse Equilibrium Problem
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
Kevin Waugh, Brian Ziebart, J. Andrew Bagnell
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
UAI
2008
14 years 11 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...