 | 2009 |
|---|
| 12 |       | Omer Giménez,
Anders Jonsson:
The Influence of k-Dependence on the Complexity of Planning.
ICAPS 2009 |
| 11 |  | Omer Giménez,
Anders Jonsson:
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard.
J. Artif. Intell. Res. (JAIR) 34: 675-706 (2009) |
| 2008 |
|---|
| 10 | | Omer Giménez,
Anders Jonsson:
In Search of the Tractability Boundary of Planning Problems.
ICAPS 2008: 99-106 |
| 9 | | Omer Giménez,
Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs.
J. Artif. Intell. Res. (JAIR) 31: 319-351 (2008) |
| 2007 |
|---|
| 8 | | Anders Jonsson:
Efficient Pruning of Operators in Planning Domains.
CAEPIA 2007: 130-139 |
| 7 | | Omer Giménez,
Anders Jonsson:
On the Hardness of Planning Problems with Simple Causal Graphs.
ICAPS 2007: 152-159 |
| 6 | | Anders Jonsson:
The Role of Macros in Tractable Planning over Causal Graphs.
IJCAI 2007: 1936-1941 |
| 5 | | Anders Jonsson,
Andrew G. Barto:
Active Learning of Dynamic Bayesian Networks in Markov Decision Processes.
SARA 2007: 273-284 |
| 2006 |
|---|
| 4 | | Paulo Trigo,
Anders Jonsson,
Helder Coelho:
Coordination with Collective and Individual Decisions.
IBERAMIA-SBIA 2006: 37-47 |
| 3 | | Anders Jonsson,
Andrew G. Barto:
Causal Graph Based Decomposition of Factored MDPs.
Journal of Machine Learning Research 7: 2259-2301 (2006) |
| 2005 |
|---|
| 2 | | Anders Jonsson,
Andrew G. Barto:
A causal approach to hierarchical decomposition of factored MDPs.
ICML 2005: 401-408 |
| 2000 |
|---|
| 1 | | Anders Jonsson,
Andrew G. Barto:
Automated State Abstraction for Options using the U-Tree Algorithm.
NIPS 2000: 1054-1060 |
