A Parallel Algorithm for Exact Bayesian Structure Discovery in Bayesian Networks

no code implementations • 7 Aug 2014 • Yetian Chen, Jin Tian, Olga Nikolova, Srinivas Aluru

Using dynamic programming (DP), the fastest known sequential algorithm computes the exact posterior probabilities of structural features in $O(2(d+1)n2^n)$ time and space, if the number of nodes (variables) in the Bayesian network is $n$ and the in-degree (the number of parents) per node is bounded by a constant $d$.

Playing the Game of 2048