2008 |
14 | EE | Samba Ndiaye,
Philippe Jégou,
Cyril Terrioux:
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
ICTAI (1) 2008: 299-306 |
13 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs.
ICTAI (1) 2008: 486-490 |
12 | EE | Cédric Pinto,
Cyril Terrioux:
A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving.
ICTAI (1) 2008: 491-495 |
2007 |
11 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Dynamic Management of Heuristics for Solving Structured CSPs.
CP 2007: 364-378 |
10 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
IJCAI 2007: 112-117 |
2006 |
9 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.
CP 2006: 741-745 |
8 | EE | Karim Boutaleb,
Philippe Jégou,
Cyril Terrioux:
(No)good Recording and ROBDDs for Solving Structured (V)CSPs.
ICTAI 2006: 297-304 |
2005 |
7 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.
CP 2005: 777-781 |
2004 |
6 | | Philippe Jégou,
Cyril Terrioux:
Decomposition and Good Recording for Solving Max-CSPs.
ECAI 2004: 196-200 |
5 | EE | Philippe Jégou,
Cyril Terrioux:
A Time-Space Trade-Off for Constraint Networks Decomposition.
ICTAI 2004: 234-239 |
2003 |
4 | EE | Cyril Terrioux,
Philippe Jégou:
Bounded Backtracking for the Valued Constraint Satisfaction Problems.
CP 2003: 709-723 |
3 | EE | Philippe Jégou,
Cyril Terrioux:
Hybrid backtracking bounded by tree-decomposition of constraint networks.
Artif. Intell. 146(1): 43-75 (2003) |
2001 |
2 | | Cyril Terrioux:
Cooperative Search and Nogood Recording.
IJCAI 2001: 260-265 |
1 | | Cyril Terrioux:
Recherche coopérative et Nogood Recording.
JFPLC 2001: 173-188 |