Pages that link to "Item:Q2372239"
From MaRDI portal
The following pages link to Partition search for non-binary constraint satisfaction (Q2372239):
Displaying 16 items.
- Strong local consistency algorithms for table constraints (Q272003) (← links)
- Computing and restoring global inverse consistency in interactive constraint satisfaction (Q334804) (← links)
- STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
- Promoting robust black-box solvers through competitions (Q606901) (← links)
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (Q968351) (← links)
- A new method for solving interval and fuzzy equations: linear case (Q1007896) (← links)
- From MDD to BDD and arc consistency (Q2331100) (← links)
- STR3: a path-optimal filtering algorithm for table constraints (Q2341830) (← links)
- Optimal and efficient filtering algorithms for table constraints (Q2342592) (← links)
- Improving the lower bound of simple tabular reduction (Q2342609) (← links)
- Efficient algorithms for singleton arc consistency (Q2430358) (← links)
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
- Partition Crossover for Pseudo-Boolean Optimization (Q2981894) (← links)
- (Q4440381) (← links)
- Constraint reasoning (Q6602253) (← links)
- A CP-based automatic tool for instantiating truncated differential characteristics (Q6623305) (← links)
