Dynamic Management of Heuristics for Solving Structured CSPs
From MaRDI portal
Recommendations
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Dynamic algorithms for classes of constraint satisfaction problems
- Recent Advances in Constraints
- Hybrid search for minimal perturbation in dynamic CSPs
Cites work
- A comparison of structural CSP decomposition methods
- Bounded backtracking for the valued constraint satisfaction problems
- Bucket elimination: A unifying framework for reasoning
- Dynamic Management of Heuristics for Solving Structured CSPs
- Graph minors. II. Algorithmic aspects of tree-width
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Hypertree decompositions and tractable queries
- On the Desirability of Acyclic Database Schemes
- Recursive conditioning
- Resolution versus search: Two strategies for SAT
- Tree clustering for constraint networks
Cited in
(5)- On the notion of cycles in hypergraphs
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- DASH: dynamic approach for switching heuristics
- Dynamic Management of Heuristics for Solving Structured CSPs
This page was built for publication: Dynamic Management of Heuristics for Solving Structured CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523068)
