455 search results - page 44 / 91 » Approximation Algorithms for Partial Covering Problems |
SOCO
2010
Springer
14 years 4 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
87
Voted
TIP
2008
14 years 9 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
72
Voted
CCCG
2007
14 years 11 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
SECON
2010
IEEE
14 years 7 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...