A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
From MaRDI portal
Publication:5941313
DOI10.1016/S0004-3702(01)00107-2zbMath0971.68035OpenAlexW1505442699MaRDI QIDQ5941313
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00107-2
Related Items
New local search methods for partial MaxSAT ⋮ Understanding the role of noise in stochastic local search: analysis and experiments ⋮ Learning MAX-SAT from contextual examples for combinatorial optimisation ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Multi-dimensional classification with Bayesian networks ⋮ Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering ⋮ Unifying tree decompositions for reasoning in graphical models ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ 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 ⋮ Complexity results for explanations in the structural-model approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Linear-space best-first search
- Network-based heuristics for constraint-satisfaction problems
- Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18--21, 2000. Proceedings
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Bucket elimination: A unifying framework for reasoning
- Generalized best-first search strategies and the optimality of A*
- Branch-and-Bound Methods: A Survey
- The Traveling-Salesman Problem and Minimum Spanning Trees
