Pages that link to "Item:Q3933756"
From MaRDI portal
The following pages link to A Sufficient Condition for Backtrack-Free Search (Q3933756):
Displaying 50 items.
- On point-duration networks for temporal reasoning (Q1614860) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Salt: A knowledge acquisition language for propose-and-revise systems (Q1823730) (← links)
- On-line algorithms for networks of temporal constraints (Q1827276) (← links)
- How to survive while visiting a graph (Q1962049) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- Model-based computing: Developing flexible machine control software (Q1978447) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Locally defined independence systems on graphs (Q2109105) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- On a new extension of BTP for binary CSPs (Q2331096) (← links)
- Constraint relaxation may be perfect (Q2384384) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- A non-binary constraint ordering heuristic for constraint satisfaction problems (Q2425983) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- The combinatorics of object recognition in cluttered environments using constrained search (Q2638810) (← links)
- Structure-driven algorithms for truth maintenance (Q2674194) (← links)
- Combining qualitative and quantitative constraints in temporal reasoning (Q2676582) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
- Degree Reduction in Labeled Graph Retrieval (Q2828204) (← links)
- Parameterized Complexity Results in Symmetry Breaking (Q3058684) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- Dynamic variable ordering in graph based backjumping algorithms for csps (Q4511615) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- A review of literature on parallel constraint solving (Q4559826) (← links)
- Fast parallel constraint satisfaction (Q4630280) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- (Q5005107) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Topological parameters for time-space tradeoff (Q5940780) (← links)
- Dynamic algorithms for classes of constraint satisfaction problems (Q5941281) (← links)
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning (Q5958761) (← links)
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)
