502 search results - page 18 / 101 » Monotone Approximation of Decision Problems |
NIPS
2007
14 years 6 days ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
AAAI
1992
13 years 12 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
SOCO
2010
Springer
13 years 5 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...
NIPS
2004
14 years 5 days ago
2004
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
DLOG
2008
14 years 1 months ago
2008
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...