Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
type: Item
instance of: scholarly article
title: Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
zbMATH Open document ID: 1213.68582
author: Ole J. Mengshoel
author: Dan Roth
author: David C. Wilkins
published in: Journal of Automated Reasoning
publication date: 2011-04-05T00:00:00Z
full work available at URL: https://figshare.com/articles/journal_contribution/Portfolios_in_Stochastic_Local_Search_Efficiently_Computing_Most_Probable_Explanations_in_Bayesian_Networks/6710177
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5874564
zbMATH Keywords: stochastic local search
zbMATH Keywords: portfolios
zbMATH Keywords: Bayesian networks
zbMATH Keywords: most probable explanations
zbMATH Keywords: determinism
zbMATH Keywords: stochastic greedy search
zbMATH Keywords: Markov chains
zbMATH Keywords: hitting times
describes a project that uses: MaxSolver
describes a project that uses: Tabu search
describes a project that uses: Walksat
describes a project that uses: MiniMaxSat
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1978964229
cites work: Approximating MAPs for belief networks is NP-hard and other theorems
cites work: Q3198876
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: On probabilistic inference by weighted model counting
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Recursive conditioning
cites work: A differential approach to inference in Bayesian networks
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Topological parameters for time-space tradeoff
cites work: AND/OR search spaces for graphical models
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: GRASP with path relinking for the weighted MAXSAT problem
cites work: Q3293678
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: Algorithm portfolios
cites work: Q4375757
cites work: Q3795276
cites work: Q3624109
cites work: Testing heuristics: We have it all wrong
cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
cites work: Local search algorithms for SAT: an empirical evaluation
cites work: Q5472387
cites work: A Bayesian approach to tackling hard computational problems. (Preliminary report)
cites work: Q3201783
cites work: A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
cites work: Q4375773
cites work: A logical approach to efficient Max-SAT solving
cites work: Q4734791
cites work: Q3624095
cites work: Efficient inference in Bayes networks as a combinatorial optimization problem
cites work: Best-First AND/OR Search for 0/1 Integer Programming
cites work: Understanding the role of noise in stochastic local search: analysis and experiments
cites work: Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
cites work: Guided local search for solving SAT and weighted MAX-SAT problems
cites work: Q5715665
cites work: Q3997653
cites work: Local search characteristics of incomplete SAT procedures
cites work: Finding MAPs for belief networks is NP-hard
cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
cites work: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
cites work: Q3624141
cites work: Q4386927
DOI: 10.1007/S10817-010-9170-5
description: scientific article; zbMATH DE number 5874564