About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SoCS 2020
Conference paper
Heuristic AND/OR search for solving influence diagrams
Abstract
We address an AND/OR search for solving influence diagrams with heuristics derived from graphical model decomposition bounds. Then, we present how the heuristics guide AND/OR branch and bound search and show its potential for solving influence diagrams on a preliminary experiment.