Fast local search methods for solving limited memory influence diagrams

DOI10.1016/J.IJAR.2015.05.003MaRDI QIDQ895537zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

decision makinglocal searchprobabilistic graphical modelsparameterized complexityinfluence diagrams

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)

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

Cites work

• scientific article; zbMATH DE number 1670535 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 1945067 (Why is no real title available?)
• scientific article; zbMATH DE number 2243356 (Why is no real title available?)
• A computational theory of decision networks
• Bayesian Networks and Decision Graphs
• Dynamic programming and influence diagrams
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
• On the hardness of approximate reasoning
• Probabilistic Networks and Expert Systems
• Representing and solving decision problems with limited information
• Solving limited memory influence diagrams
• The necessity of bounded treewidth for efficient inference in Bayesian networks
• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT

Cited in

(7)

• Strategy Graphs for Influence Diagrams
• Influence diagrams with memory states: representation and algorithms
• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
• On Imperfect Recall in Multi-Agent 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

Describes a project that uses

Uses Software

• ElemStatLearn
• k-Neighborhood
• Hailfinder

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)