810 search results - page 115 / 162 » Solving Time-Dependent Planning Problems |
AAAI
1990
13 years 9 months ago
1990
Explanation requires a dialogue. Users must be allowed to ask questions about previously given explanations. However, building an interface that allows users to ask follow-up ques...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
ICTAI
2002
IEEE
14 years 27 days ago
2002
IEEE
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
ICTAI
1999
IEEE
14 years 7 days ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...