- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i2 |      | Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary: Solving WCSP by Extraction of Minimal Unsatisfiable Cores. CoRR abs/1304.5449 (2013) |
| 2012 | ||
| j10 | | Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon: The International SAT Solver Competitions. AI Magazine 33(1) (2012) |
| j9 | | Olivier Bodini, Olivier Roussel, Michèle Soria: Boltzmann samplers for first-order differential specifications. Discrete Applied Mathematics 160(18): 2563-2572 (2012) |
| j8 | | Olivier Bodini, Danièle Gardy, Olivier Roussel: Boys-and-girls Birthdays and Hadamard Products. Fundam. Inform. 117(1-4): 85-101 (2012) |
| c13 | | Olivier Roussel: Behind the Scene of Solvers Competitions: the "evaluation" Experience. COMPARE 2012: 66-77 |
| c12 | | Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary: Propagating Soft Table Constraints. CP 2012: 390-405 |
| c11 | | Christophe Lecoutre, Olivier Roussel, Djamel E. Dehani: WCSP Integration of Soft Neighborhood Substitutability. CP 2012: 406-421 |
| 2011 | ||
| j7 | | |
| 2010 | ||
| j6 | | Christophe Lecoutre, Olivier Roussel, Marc R. C. van Dongen: Promoting robust black-box solvers through competitions. Constraints 15(3): 317-326 (2010) |
| j5 | | Olivier Roussel, Kai Schneider: Coherent Vortex Simulation of weakly compressible turbulent mixing layers using adaptive multiresolution methods. J. Comput. Physics 229(6): 2267-2286 (2010) |
| 2009 | ||
| j4 | | Olivier Roussel, Michèle Soria: Boltzmann sampling of ordered structures. Electronic Notes in Discrete Mathematics 35: 305-310 (2009) |
| c10 | | Christophe Lecoutre, Olivier Roussel: Failed Value Consistencies for Constraint Satisfaction. CP 2009: 554-568 |
| c9 | | Olivier Bailleux, Yacine Boufkhad, Olivier Roussel: New Encodings of Pseudo-Boolean Constraints into CNF. SAT 2009: 181-194 |
| p1 | | Olivier Roussel, Vasco M. Manquinho: Pseudo-Boolean and Cardinality Constraints. Handbook of Satisfiability 2009: 695-733 |
| i1 | | Olivier Roussel, Christophe Lecoutre: XML Representation of Constraint Networks: Format XCSP 2.1. CoRR abs/0902.2362 (2009) |
| 2008 | ||
| c8 | | Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel: A Decomposition Technique for Max-CSP. ECAI 2008: 500-504 |
| 2006 | ||
| j3 | | Vasco M. Manquinho, Olivier Roussel: The First Evaluation of Pseudo-Boolean Solvers (PB'05). JSAT 2(1-4): 103-143 (2006) |
| j2 | | Olivier Bailleux, Yacine Boufkhad, Olivier Roussel: A Translation of Pseudo Boolean Constraints to SAT. JSAT 2(1-4): 191-200 (2006) |
| 2004 | ||
| c7 | | |
| 2000 | ||
| j1 | | Olivier Roussel, Philippe Mathieu: The Achievement of Knowledge Bases by Cycle Search. Inf. Comput. 162(1-2): 43-58 (2000) |
| c6 | | |
| 1997 | ||
| c5 | | Olivier Roussel, Philippe Mathieu: Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case. CADE 1997: 161-175 |
| c4 |  | Olivier Roussel, Philippe Mathieu: Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel. JFPLC 1997: 261-276 |
| 1996 | ||
| c3 | | Olivier Roussel, Philippe Mathieu: A New Method for Knowledge Compilation: The Achievement by Cycle Search. CADE 1996: 493-507 |
| c2 | | Olivier Roussel, Philippe Mathieu: Une nouvelle méthode de compilation logique: l'achèvement par cycles. JFPLC 1996: 271-286 |
| 1995 | ||
| c1 | | Olivier Roussel, Philippe Mathieu: Évaluation des méthodes d'achèvement par parties. JFPLC 1995: 175-189 |
Colors in the list of coauthors
Last update Thu May 23 06:49:24 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page