Mini-buckets
From MaRDI portal
Publication:3455559
DOI10.1145/636865.636866zbMath1326.68335OpenAlexW2112937598MaRDI QIDQ3455559
Publication date: 7 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/636865.636866
Bayesian networkscombinatorial optimizationapproximation algorithmsprobabilistic inferenceaccuracy/complexity trade-off
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (24)
Ordered valuation algebras: A generic framework for approximating inference ⋮ Partition search for non-binary constraint satisfaction ⋮ Tractability-preserving transformations of global cost functions ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ Multiple-choice knapsack constraint in graphical models ⋮ Oblivious bounds on the probability of boolean functions ⋮ Virtual pairwise consistency in cost function networks ⋮ Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ Algebraic Structures for Bipolar Constraint-Based Reasoning ⋮ Computational protein design as an optimization problem ⋮ Subproblem ordering heuristics for AND/OR best-first search ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ A logic of soft constraints based on partially ordered preferences ⋮ Bucket elimination for multiobjective optimization problems ⋮ Variable neighborhood search for graphical model energy minimization ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Unnamed Item ⋮ Constraint Optimization Techniques for Exact Multi-Objective Optimization ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ Bucket renormalization for approximate inference ⋮ Gauges, loops, and polynomials for partition functions of graphical models
This page was built for publication: Mini-buckets
