Sciweavers

88 search results - page 5 / 18
» Deduction-Based Refinement Planning
Sort
View
AIPS
1996
13 years 9 months ago
A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of...
Subbarao Kambhampati, Laurie H. Ihrig, Biplav Sriv...
AIPS
1998
13 years 9 months ago
Search Control of Plan Generation in Decision-Theoretic Planners
This paper addresses the search control problemof selecting whichplan to refine next for decision-theoretic planners, a choice point commonto the decision theoretic planners creat...
Richard Goodwin, Reid G. Simmons
CIKM
2006
Springer
13 years 11 months ago
Improving query I/O performance by permuting and refining block request sequences
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
Xiaoyu Wang, Mitch Cherniack
CIA
2008
Springer
13 years 9 months ago
Incrementally Refined Acquaintance Model for Consortia Composition
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The ...
Jan Doubek, Jirí Vokrínek, Michal Pe...
ATAL
2006
Springer
13 years 11 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith