Fast local search methods for solving limited memory influence diagrams
DOI10.1016/J.IJAR.2015.05.003zbMATH Open1346.68178OpenAlexW341277852WikidataQ62046524 ScholiaQ62046524MaRDI QIDQ895537FDOQ895537
Authors: D. D. Maua, Fabio Gagliardi Cozman 
Publication date: 3 December 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2015.05.003
Recommendations
- Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
- Solving limited memory influence diagrams
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
- Representing and solving decision problems with limited information
- Influence diagrams with memory states: representation and algorithms
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)
Cites Work
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- Probabilistic Networks and Expert Systems
- Bayesian Networks and Decision Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- On the hardness of approximate reasoning
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Representing and solving decision problems with limited information
- Title not available (Why is that?)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
- Dynamic programming and influence diagrams
- A computational theory of decision networks
- Solving limited memory influence diagrams
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
- Title not available (Why is that?)
Cited In (7)
- Influence diagrams with memory states: representation and algorithms
- Solving limited memory influence diagrams
- Strategy Graphs for Influence Diagrams
- On Imperfect Recall in Multi-Agent Influence Diagrams
- Representing and solving decision problems with limited information
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
- Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
Uses Software
This page was built for publication: Fast local search methods for solving limited memory influence diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895537)
