698 search results - page 110 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
AI
2000
Springer
13 years 9 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...