Sciweavers

3221 search results - page 72 / 645
» Termination of Linear Programs
Sort
View
NIPS
2003
13 years 9 months ago
Linear Program Approximations for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
Milos Hauskrecht, Branislav Kveton
SIAMCO
2008
70views more  SIAMCO 2008»
13 years 7 months ago
Duality in Linear Programming Problems Related to Deterministic Long Run Average Problems of Optimal Control
It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev
PPDP
2010
Springer
13 years 5 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
ENDM
2010
115views more  ENDM 2010»
13 years 5 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
AAAI
2011
12 years 8 months ago
Linear Dynamic Programs for Resource Management
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
Marek Petrik, Shlomo Zilberstein