 | 2009 |
| 9 |  | Jeffrey Johns,
Marek Petrik,
Sridhar Mahadevan:
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation.
ECML/PKDD (1) 2009: 9 |
| 8 |  | Marek Petrik,
Shlomo Zilberstein:
Constraint relaxation in approximate linear programs.
ICML 2009: 102 |
| 2008 |
| 7 |  | Martin Allen,
Marek Petrik,
Shlomo Zilberstein:
Interaction Structure and Dimensionality Reduction in Decentralized MDPs.
AAAI 2008: 1440-1441 |
| 6 |  | Marek Petrik,
Shlomo Zilberstein:
Learning Heuristic Functions through Approximate Linear Programming.
ICAPS 2008: 248-255 |
| 5 |  | Marek Petrik,
Bruno Scherrer:
Biasing Approximate Dynamic Programming with a Lower Discount Factor.
NIPS 2008: 1265-1272 |
| 2007 |
| 4 |  | Marek Petrik,
Shlomo Zilberstein:
Anytime Coordination Using Separable Bilinear Programs.
AAAI 2007: 750-755 |
| 3 |  | Marek Petrik,
Shlomo Zilberstein:
Average-Reward Decentralized Markov Decision Processes.
IJCAI 2007: 1997-2002 |
| 2 |  | Marek Petrik:
An Analysis of Laplacian Methods for Value Function Approximation in MDPs.
IJCAI 2007: 2574-2579 |
| 2006 |
| 1 |  | Marek Petrik,
Shlomo Zilberstein:
Learning parallel portfolios of algorithms.
Ann. Math. Artif. Intell. 48(1-2): 85-106 (2006) |