10 citations · 23 across the 3 of their papers we have counts for
3 papers
cs.AI2012★ 10 cited
Solving Multistage Influence Diagrams using Branch-and-Bound Search
Changhe Yuan, Xiaojian Wu, Eric A. Hansen
A branch-and-bound approach to solving influ- ence diagrams has been previously proposed in the literature, but appears to have never been implemented and evaluated - apparently du…
cs.AI2012★ 9 cited
Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search
Brandon Malone, Changhe Yuan, Eric A. Hansen +1
Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A*…
cs.AI2012★ 4 cited
Suboptimality Bounds for Stochastic Shortest Path Problems
Eric A. Hansen
We consider how to use the Bellman residual of the dynamic programming operator to compute suboptimality bounds for solutions to stochastic shortest path problems. Such bounds have…