Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams

DOI10.1007/978-3-319-11433-0_22zbMath1443.68167OpenAlexW2280673958MaRDI QIDQ2938418

Denis Deratani Mauá, Fabio G. Cozman

Publication date: 14 January 2015

Published in: Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11433-0_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ k-Neighborhood

This page was built for publication: Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams