40 search results - page 2 / 8 » Smooth Optimal Decision Strategies for Static Team Optimizat... |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
CDC
2008
IEEE
13 years 7 months ago
2008
IEEE
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
NIPS
2007
13 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
ATAL
2004
Springer
13 years 11 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...