Solving Multistage Influence Diagrams using Branch-and-Bound Search

Details Solving Multistage Influence Diagrams using Branch-and-Bound Search Solving Multistage Influence Diagrams using Branch-and-Bound Search

2012-03-15

arxiv.org/abs/1203.3531v1

Computer Science

Artificial Intelligence

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

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 due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, we describe how to efficiently compute effective bounds, and we develop a practical implementa- tion of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solving influence diagrams with multiple stages.

Affiliated with

Also associated with

No associations

Rating

Solving Multistage Influence Diagrams using Branch-and-Bound Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Multistage Influence Diagrams using Branch-and-Bound Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Multistage Influence Diagrams using Branch-and-Bound Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32410