570 search results - page 40 / 114 » The Complexity of Reasoning with Global Constraints |
SI3D
2003
ACM
15 years 3 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
AAAI
2008
15 years 1 days ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
IJCAI
1997
14 years 11 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...