Sciweavers

914 search results - page 9 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
LPAR
2007
Springer
14 years 1 months ago
Complexity of Planning in Action Formalisms Based on Description Logics
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic
IROS
2006
IEEE
121views Robotics» more  IROS 2006»
14 years 1 months ago
Planning and Acting in Uncertain Environments using Probabilistic Inference
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...
Deepak Verma, Rajesh P. N. Rao
ICAC
2005
IEEE
14 years 1 months ago
The Case for Automated Planning in Autonomic Computing
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizin...
Biplav Srivastava, Subbarao Kambhampati
WSC
2007
13 years 10 months ago
Hierarchical planning and multi-level scheduling for simulation-based probabilistic risk assessment
Simulation of dynamic complex systems—specifically, those comprised of large numbers of components with stochastic behaviors—for the purpose of probabilistic risk assessment f...
Hamed Nejad, Dongfeng Zhu, Ali Mosleh
COMPGEOM
1995
ACM
13 years 11 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky