Sciweavers

879 search results - page 8 / 176
» Providing Decision Capabilities to Coordinators in Distribut...
Sort
View
ATAL
2005
Springer
14 years 1 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
IJCAI
2007
13 years 9 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
WWW
2008
ACM
14 years 8 months ago
Making BPEL flexible: adapting in the context of coordination constraints using WS-BPEL
While WS-BPEL is emerging as the prominent language for modeling executable business processes, it provides limited support for designing flexible processes. An important need of ...
Yunzhou Wu, Prashant Doshi
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 1 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
AAAI
2011
12 years 7 months ago
Coordinated Multi-Agent Reinforcement Learning in Networked Distributed POMDPs
In many multi-agent applications such as distributed sensor nets, a network of agents act collaboratively under uncertainty and local interactions. Networked Distributed POMDP (ND...
Chongjie Zhang, Victor R. Lesser