914 search results - page 20 / 183 » The Computational Complexity of Probabilistic Planning |
IAT
2005
IEEE
14 years 1 months ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present an outdoor terrain planner that finds near optimal trajectories under dynamic and kinematic constraints. The planner can find solutions in close to real time by re...
BIRTHDAY
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
IJRR
2010
13 years 5 months ago
2010
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
ENTCS
2007
13 years 7 months ago
2007
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...