The following pages link to Cyril Terrioux (Q253986):
Displaying 11 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids (Q2079271) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Dynamic Management of Heuristics for Solving Structured CSPs (Q3523068) (← links)
- Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms (Q4922904) (← links)
- Variable Elimination in Binary CSPs (Q4972725) (← links)
- (Q5283010) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897224) (← links)
