Dynamic algorithms for classes of constraint satisfaction problems
From MaRDI portal
Recommendations
Cites work
- A sufficient condition for backtrack-bounded search
- A Sufficient Condition for Backtrack-Free Search
- Amortized Computational Complexity
- Approximation of Constraint Satisfaction via local search
- Consistency in networks of relations
- Constraint relaxation may be perfect
- Fast parallel constraint satisfaction
- scientific article; zbMATH DE number 1002207 (Why is no real title available?)
- scientific article; zbMATH DE number 4049150 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimal Representation of Directed Hypergraphs
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Synthesizing constraint expressions
Cited in
(6)- An efficient algorithm for a class of constraint satisfaction problems
- Nature-inspired techniques for dynamic constraint satisfaction problems
- scientific article; zbMATH DE number 1670594 (Why is no real title available?)
- Dynamic Management of Heuristics for Solving Structured CSPs
- Constraint updating
- scientific article; zbMATH DE number 2152986 (Why is no real title available?)
This page was built for publication: Dynamic algorithms for classes of constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941281)