The SCEAS System
Navigation Menu

Search the dblp DataBase


Cyril Terrioux: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philippe Jégou, Samba Ndiaye, Cyril Terrioux
    Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:777-781 [Conf]
  2. Philippe Jégou, Samba Ndiaye, Cyril Terrioux
    An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:741-745 [Conf]
  3. Cyril Terrioux, Philippe Jégou
    Bounded Backtracking for the Valued Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:709-723 [Conf]
  4. Philippe Jégou, Cyril Terrioux
    Decomposition and Good Recording for Solving Max-CSPs. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:196-200 [Conf]
  5. Philippe Jégou, Cyril Terrioux
    A Time-Space Trade-Off for Constraint Networks Decomposition. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:234-239 [Conf]
  6. Karim Boutaleb, Philippe Jégou, Cyril Terrioux
    (No)good Recording and ROBDDs for Solving Structured (V)CSPs. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:297-304 [Conf]
  7. Cyril Terrioux
    Cooperative Search and Nogood Recording. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:260-265 [Conf]
  8. Philippe Jégou, Samba Ndiaye, Cyril Terrioux
    Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:112-117 [Conf]
  9. Cyril Terrioux
    Recherche coopérative et Nogood Recording. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2001, pp:173-188 [Conf]
  10. Philippe Jégou, Cyril Terrioux
    Hybrid backtracking bounded by tree-decomposition of constraint networks. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:146, n:1, pp:43-75 [Journal]
  11. Philippe Jégou, Samba Ndiaye, Cyril Terrioux
    Dynamic Management of Heuristics for Solving Structured CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:364-378 [Conf]

  12. A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. [Citation Graph (, )][DBLP]

  13. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. [Citation Graph (, )][DBLP]

  14. A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving. [Citation Graph (, )][DBLP]

  15. Combined Strategies for Decomposition-Based Methods for Solving CSPs. [Citation Graph (, )][DBLP]

  16. A Generalized Cyclic-Clustering Approach for Solving Structured CSPs. [Citation Graph (, )][DBLP]

  17. A Tree Decomposition Based Approach to Solve Structured SAT Instances. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002