Pages that link to "Item:Q3523053"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2007 (Q3523053):
Displayed 35 items.
- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite (Q3523054) (← links)
- GAC Via Unit Propagation (Q3523055) (← links)
- Solution Directed Backjumping for QCSP (Q3523056) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Encodings of the Sequence Constraint (Q3523058) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming (Q3523062) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- Dealing with Incomplete Preferences in Soft Constraint Problems (Q3523064) (← links)
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (Q3523065) (← links)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability (Q3523066) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- Dynamic Management of Heuristics for Solving Structured CSPs (Q3523068) (← links)
- Valid Inequality Based Lower Bounds for WCSP (Q3523069) (← links)
- Breaking Symmetry of Interchangeable Variables and Values (Q3523071) (← links)
- Path Consistency by Dual Consistency (Q3523072) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Scheduling Conditional Task Graphs (Q3523074) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- AND/OR Multi-valued Decision Diagrams for Constraint Optimization (Q3523076) (← links)
- Propagation = Lazy Clause Generation (Q3523077) (← links)
- Decomposing Global Grammar Constraints (Q3523078) (← links)
- Constructive Interval Disjunction (Q3523079) (← links)
- An LP-Based Heuristic for Optimal Planning (Q3523080) (← links)
- A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs (Q3523081) (← links)
- On Universal Restart Strategies for Backtracking Search (Q3523083) (← links)
- Hierarchical Hardness Models for SAT (Q3523084) (← links)
- Filtering for Subgraph Isomorphism (Q3523085) (← links)
- Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086) (← links)
- An Analysis of Slow Convergence in Interval Propagation (Q3523087) (← links)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
- The Log-Support Encoding of CSP into SAT (Q3523089) (← links)
- Groupoids and Conditional Symmetry (Q3523090) (← links)
- CP-Based Local Branching (Q3523091) (← links)
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty (Q3523093) (← links)