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.
- Projection, consistency, and George Boole (Q265702) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- SampleSearch: importance sampling in presence of determinism (Q543621) (← links)
- Fusion, propagation, and structuring in belief networks (Q578932) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- On some partial line graphs of a hypergraph and the associated matroid (Q686485) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Fuzzy constraint networks for signal pattern recognition (Q814488) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (Q850456) (← links)
- Decision-support with preference constraints (Q857275) (← links)
- Distributed CSPs by graph partitioning (Q864803) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- A fuzzy constraint satisfaction approach for signal abstraction (Q962860) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Reasoning about cardinal directions between extended objects (Q991028) (← links)
- Approximated consistency for the automatic recording constraint (Q1010285) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Tree clustering for constraint networks (Q1116363) (← links)
- Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646) (← links)
- No more ``Partial'' and ``Full Looking Ahead'' (Q1128494) (← links)
- Temporal constraint networks (Q1182161) (← links)
- From local to global consistency (Q1193482) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach (Q1204867) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Fast parallel constraint satisfaction (Q1313952) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- Arc-consistency for continuous variables (Q1321065) (← links)
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems (Q1332852) (← links)
- Local consistency in parallel constraint satisfaction networks (Q1337684) (← links)
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems (Q1341668) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- From local to global consistency in temporal constraint networks (Q1391930) (← links)
- Local and global relational consistency (Q1391940) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions (Q1392104) (← links)
- A probabilistic analysis of randomly generated binary constraint satisfaction problems. (Q1401196) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras (Q1583517) (← links)
- Decomposable constraints (Q1589469) (← links)
- Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
