### 6 papers:

- ICALP-v1-2012-EtessamiSY #algorithm #branch #equation #markov #polynomial #probability #process
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.
- PPDP-2011-SauthoffJG #declarative #programming
- Bellman’s GAP: a declarative language for dynamic programming (GS, SJ, RG), pp. 29–40.
- LDTA-2011-GiegerichS #analysis #compilation
- Yield grammar analysis in the Bellman’s GAP compiler (RG, GS), p. 7.
- ICML-2010-Scherrer #difference #fixpoint #perspective
- Should one compute the Temporal Difference fix point or minimize the Bellman Residual? The unified oblique projection view (BS), pp. 959–966.
- ICML-2004-KerstingOR #relational
- Bellman goes relational (KK, MvO, LDR).
- ICML-2003-EngelMM #approach #difference #learning #process
- Bayes Meets Bellman: The Gaussian Process Approach to Temporal Difference Learning (YE, SM, RM), pp. 154–161.