140 citations · 1.3k across the 125 of their papers we have counts for
Showing 2012 · cs.AIShow all
2 papers · 2 filters
cs.AI2012
Solving Factored MDPs with Continuous and Discrete Variables
Carlos E. Guestrin, Milos Hauskrecht, Branislav Kveton
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods c…
cs.AI2012★ 3 cited
Partitioned Linear Programming Approximations for MDPs
Branislav Kveton, Milos Hauskrecht
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal…