87 citations · 166 across the 13 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.AI2013★ 11 cited
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks
Brandon Malone, Changhe Yuan
Exact algorithms for learning Bayesian networks guarantee to find provably optimal networks. However, they may fail in difficult learning tasks due to limited time or memory. In th…
cs.AI2013
Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search
Arindam Khaled, Eric A. Hansen, Changhe Yuan
A limited-memory influence diagram (LIMID) generalizes a traditional influence diagram by relaxing the assumptions of regularity and no-forgetting, allowing a wider range of decisi…