International Joint Conference on Artificial Intelligence
year
2005
pages
1287--1292
comment
Memory-bounded dynamic programming.
Iteratively improving each FSC by linear programming with other FSCs fixed.
Bounded Policy Iteration (BPI).
---=note-separator=---
Memory-bounded dynamic programming. Iteratively improving each FSC by linear programming with other FSCs fixed. Bounded Policy Iteration (BPI).