AND/OR search spaces for graphical models
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1894279
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Graph space: using both geometric and probabilistic structure to evaluate statistical graph models
- Searching for the m best solutions in graphical models
- Graphical Models: Queries, Complexity, Algorithms
- scientific article; zbMATH DE number 1946873
- Graphical models
- Graphical models
- Modelling and searching of combinatorial spaces based on Markov logic networks
Cites work
- A differential approach to inference in Bayesian networks
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Backjump-based backtracking for constraint satisfaction problems
- Bounded backtracking for the valued constraint satisfaction problems
- Bucket elimination: A unifying framework for reasoning
- Case-factor diagrams for structured probabilistic modeling
- Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
- Compiling CSPs into tree-driven automata for interactive solving
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's
- Graph driven BDDs -- a new data structure for Boolean functions
- Graph minors. I. Excluding a forest
- Graph-Based Algorithms for Boolean Function Manipulation
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1452706 (Why is no real title available?)
- scientific article; zbMATH DE number 219228 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Interpolants and Symbolic Model Checking
- Network-based heuristics for constraint-satisfaction problems
- Quickly excluding a forest
- Recursive conditioning
- Resolution versus search: Two strategies for SAT
- Tree clustering for constraint networks
- Unifying tree decompositions for reasoning in graphical models
- Valuation-Based Systems for Bayesian Decision Analysis
Cited in
(37)- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Subproblem ordering heuristics for AND/OR best-first search
- Importance sampling-based estimation over AND/OR search spaces for graphical models
- Compositional convolutional neural networks: a robust and interpretable model for object recognition under occlusion
- \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Sufficient and necessary conditions for solution finding in valuation-based systems
- Sum-product graphical models
- On probabilistic inference by weighted model counting
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Computational protein design as an optimization problem
- Case-factor diagrams for structured probabilistic modeling
- Anytime AND/OR depth-first search for combinatorial optimization
- On converting sum-product networks into Bayesian networks
- Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
- scientific article; zbMATH DE number 4164200 (Why is no real title available?)
- Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
- Concurrent forward bounding for distributed constraint optimization problems
- Best-First AND/OR Search for 0/1 Integer Programming
- The generalized A* architecture
- AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
- Max margin learning of hierarchical configural deformable templates (HCDTs) for efficient object parsing and pose estimation
- A numerical study of the bottom-up and top-down inference processes in and-or graphs
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- AND/OR search for marginal MAP
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- Robust Solutions in Unstable Optimization Problems
- Residual-guided look-ahead in AND/OR search for graphical models
- SampleSearch: importance sampling in presence of determinism
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Theoretical foundations for parent divorcing transformations in Bayesian networks
- Learning optimal decision trees using constraint programming
- Mixed deterministic and probabilistic networks
- Efficient sequence alignment with side-constraints by cluster tree elimination
This page was built for publication: AND/OR search spaces for graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028898)
