Sciweavers

2 search results - page 1 / 1
» Maximal Prime Subgraph Decomposition of Bayesian Networks
Sort
View
70
Voted
FLAIRS
2001
15 years 11 days ago
Maximal Prime Subgraph Decomposition of Bayesian Networks
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
Kristian G. Olesen, Anders L. Madsen
JMLR
2006
153views more  JMLR 2006»
14 years 11 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis