Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams Jan 1, 2016· Denis Deratani Mauá · 0 min read URL Cite DOI Type Journal article Publication International Journal of Approximate Reasoning Last updated on Jan 1, 2016 ← Better Initialization Heuristics for Order-based Bayesian Network Structure Learning Jan 1, 2016 Fast local search methods for solving limited memory influence diagrams Jan 1, 2016 →