334 search results - page 12 / 67 » How to Dynamically Merge Markov Decision Processes |
EURONGI
2006
Springer
15 years 1 months ago
2006
Springer
Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network ...
NIPS
2008
14 years 11 months ago
2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we consider social peer-to-peer (P2P) networks, where peers are sharing their resources (i.e., multimedia content and upload bandwidth). In the considered P2P netwo...
AAAI
2011
13 years 9 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...