242 search results - page 2 / 49 » Provably Bounded Optimal Agents |
UAI
2001
13 years 6 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
UAI
2000
13 years 6 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
EUROPAR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
AIPS
2010
13 years 7 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...