Sciweavers

162 search results - page 17 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
AAAI
2012
13 years 6 days ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani
RTCSA
2005
IEEE
15 years 3 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
AAAI
2004
14 years 11 months ago
Performance Bounded Reinforcement Learning in Strategic Interactions
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
Bikramjit Banerjee, Jing Peng
AAMAS
2007
Springer
14 years 10 months ago
Generalized multiagent learning with performance bound
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
Bikramjit Banerjee, Jing Peng
LPNMR
2009
Springer
15 years 4 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas