| 2002 |
|---|
| 9 | | Theodore J. Perkins:
Reinforcement Learning for POMDPs Based on Action Values and Stochastic Optimization.
AAAI/IAAI 2002: 199-204 |
| 8 | | Daniel S. Bernstein,
Theodore J. Perkins,
Shlomo Zilberstein,
Lev Finkelstein:
Scheduling Contract Algorithms on Multiple Processors.
AAAI/IAAI 2002: 702-706 |
| 7 | | Theodore J. Perkins,
Mark D. Pendrith:
On the Existence of Fixed Points for Q-Learning and Sarsa in Partially Observable Domains.
ICML 2002: 490-497 |
| 6 | EE | Theodore J. Perkins,
Doina Precup:
A Convergent Form of Approximate Policy Iteration.
NIPS 2002: 1595-1602 |
| 5 | EE | Theodore J. Perkins,
Andrew G. Barto:
Lyapunov Design for Safe Reinforcement Learning.
Journal of Machine Learning Research 3: 803-832 (2002) |
| 2001 |
|---|
| 4 | | Theodore J. Perkins,
Andrew G. Barto:
Lyapunov-Constrained Action Sets for Reinforcement Learning.
ICML 2001: 409-416 |
| 3 | | Theodore J. Perkins,
Andrew G. Barto:
Heuristic Search in Infinite State Spaces Guided by Lyapunov Analysis.
IJCAI 2001: 242-247 |
| 2000 |
|---|
| 2 | | Robert Moll,
Theodore J. Perkins,
Andrew G. Barto:
Machine Learning for Subproblem Selection.
ICML 2000: 615-622 |
| 1998 |
|---|
| 1 | EE | Robert Moll,
Andrew G. Barto,
Theodore J. Perkins,
Richard S. Sutton:
Learning Instance-Independent Value Functions to Enhance Local Search.
NIPS 1998: 1017-1023 |
