914 search results - page 26 / 183 » The Computational Complexity of Probabilistic Planning |
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
COMAD
2009
13 years 11 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
WWW
2002
ACM
14 years 11 months ago
2002
ACM
This paper presents an approach to develop bidding agents that participate in multiple alternative auctions, with the goal of obtaining an item at the lowest price. The approach c...
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X