Fast local search methods for solving limited memory influence diagrams
type: Item
instance of: scholarly article
title: Fast local search methods for solving limited memory influence diagrams
zbMATH Open document ID: 1346.68178
author: D. D. Maua
author: Fabio Gagliardi Cozman
published in: International Journal of Approximate Reasoning
publication date: 2015-12-03T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6516060
zbMATH Keywords: influence diagrams
zbMATH Keywords: probabilistic graphical models
zbMATH Keywords: decision making
zbMATH Keywords: local search
zbMATH Keywords: parameterized complexity
Wikidata QID: Q62046524
describes a project that uses: ElemStatLearn
describes a project that uses: Hailfinder
describes a project that uses: k-Neighborhood
MaRDI profile type: Publication
full work available at URL: j.ijar.2015.05.003
OpenAlex ID: W341277852
cites work: Probabilistic Networks and Expert Systems
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Q2753732
cites work: Bayesian Networks and Decision Graphs
cites work: Q4408097
cites work: The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
cites work: Representing and Solving Decision Problems with Limited Information
cites work: Solving limited memory influence diagrams
cites work: On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
cites work: Q5715665
cites work: On the hardness of approximate reasoning
cites work: The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
cites work: Dynamic programming and influence diagrams
cites work: A computational theory of decision networks
DOI: 10.1016/J.IJAR.2015.05.003
description: scientific article; zbMATH DE number 6516060