Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
From MaRDI portal
Publication:2429986
Recommendations
- Algorithm portfolios
- Most probable explanations in Bayesian networks: complexity and tractability
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- scientific article; zbMATH DE number 2096817
- MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation
Cites work
- A Bayesian approach to tackling hard computational problems. (Preliminary report)
- A Computing Procedure for Quantification Theory
- A differential approach to inference in Bayesian networks
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- A logical approach to efficient Max-SAT solving
- A machine program for theorem-proving
- Algorithm portfolios
- AND/OR search spaces for graphical models
- Approximating MAPs for belief networks is NP-hard and other theorems
- Bandwidth Packing: A Tabu Search Approach
- Best-First AND/OR Search for 0/1 Integer Programming
- Bucket elimination: A unifying framework for reasoning
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Finding MAPs for belief networks is NP-hard
- GRASP with path relinking for the weighted MAXSAT problem
- Guided local search for solving SAT and weighted MAX-SAT problems
- scientific article; zbMATH DE number 4174342 (Why is no real title available?)
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1114005 (Why is no real title available?)
- scientific article; zbMATH DE number 1149408 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- Local search algorithms for SAT: an empirical evaluation
- Local search characteristics of incomplete SAT procedures
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- Network-based heuristics for constraint-satisfaction problems
- New inference rules for Max-SAT
- On probabilistic inference by weighted model counting
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Recursive conditioning
- SATzilla: portfolio-based algorithm selection for SAT
- Stochastic local search. Foundations and applications.
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Testing heuristics: We have it all wrong
- The computational complexity of probabilistic inference using Bayesian belief networks
- Topological parameters for time-space tradeoff
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Understanding the role of noise in stochastic local search: analysis and experiments
Cited in
(6)- Understanding the role of noise in stochastic local search: analysis and experiments
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- New local search methods for partial MaxSAT
- Visualizing pseudo-Boolean functions: feature selection and regularization for machine learning
- Understanding the scalability of Bayesian network inference using clique tree growth curves
This page was built for publication: Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429986)
