334 search results - page 49 / 67 » How to Dynamically Merge Markov Decision Processes |
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...
154
click to vote
ICCAD
2003
IEEE
15 years 2 months ago
2003
IEEE
While performance, area, and power constraints have been the driving force in designing current communication-enabled embedded systems, post-fabrication and run-time adaptability ...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
73
Voted
AAAI
2008
14 years 12 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
FPL
2008
Springer
14 years 11 months ago
2008
Springer
Traditional microprocessor-based solutions are insufficient to serve the dynamic throughput demands of real-time scalable multimedia processing systems. This paper introduces a Po...