Pages that link to "Item:Q1399134"
From MaRDI portal
The following pages link to A theoretical evaluation of selected backtracking algorithms. (Q1399134):
Displaying 26 items.
- A survey of constraint-based programming paradigms (Q458465) (← links)
- A semantic approach for web reasoning (Q506365) (← links)
- Hybrid search for minimal perturbation in dynamic CSPs (Q647481) (← links)
- Making assumptions in the automated derivation (Q707362) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Asynchronous forward-checking for DisCSPs (Q879978) (← links)
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning (Q1274559) (← links)
- A theoretical evaluation of selected backtracking algorithms. (Q1399134) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Search algorithms in type theory (Q1575934) (← links)
- Decomposable constraints (Q1589469) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Binary vs. non-binary constraints (Q1614859) (← links)
- On point-duration networks for temporal reasoning (Q1614860) (← links)
- A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints (Q1792697) (← links)
- On the relations between SAT and CSP enumerative algorithms (Q1841881) (← links)
- On forward checking for non-binary constraint satisfaction. (Q1852854) (← links)
- The fixed point property for ordered sets (Q1927945) (← links)
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem (Q2101278) (← links)
- Concurrent search for distributed CSPs (Q2457634) (← links)
- Constraint satisfaction methods for solving the staff transfer problem (Q2476428) (← links)
- The automorphism conjecture for small sets and series parallel sets (Q2494393) (← links)
- Multiway spatial joins (Q3507292) (← links)
- Backjumping is Exception Handling (Q4957217) (← links)
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (Q5958710) (← links)