564 search results - page 25 / 113 » Approximation algorithms for restricted Bayesian network str... |
117
click to vote
NIPS
2001
15 years 3 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
109
click to vote
UAI
2003
15 years 3 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
117
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
136
click to vote
ICML
1996
IEEE
16 years 3 months ago
1996
IEEE
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...
133
click to vote
NIPS
2008
15 years 3 months ago
2008
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...