Learning cluster-based structure to solve constraint satisfaction problems
From MaRDI portal
Recommendations
- Constrained clustering by constraint programming
- Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
- Clustering formulation using constraint optimization
- Reconstruction and clustering in random constraint satisfaction problems
- Tree clustering for constraint networks
- Optimal search on clustered structural constraint for learning Bayesian network structure
Cites work
- scientific article; zbMATH DE number 683337 (Why is no real title available?)
- scientific article; zbMATH DE number 2084732 (Why is no real title available?)
- A Sufficient Condition for Backtrack-Free Search
- Compiling constraint satisfaction problems
- Constraint Satisfaction with Bounded Treewidth Revisited
- Decomposing constraint satisfaction problems using database techniques
- Identifying and exploiting problem structures using explanation-based constraint programming
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
- Locality and hard SAT-instances
- Optimal speedup of Las Vegas algorithms
- Planning in a hierarchy of abstraction spaces
- Principles and Practice of Constraint Programming – CP 2004
- Radio link frequency assignment
- Tradeoffs in the Complexity of Backdoor Detection
- Tree clustering for constraint networks
- Typed Guarded Decompositions for Constraint Satisfaction
- Variable Neighborhood Search
- Variable neighborhood search for the maximum clique
This page was built for publication: Learning cluster-based structure to solve constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647439)
