default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Roussel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel
:
Compressing UNSAT CDCL Trees with Caching. ICAART (3) 2024: 792-799- 2023
- [c21]Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel:
Compressing UNSAT Search Trees with Caching. ICAART (3) 2023: 358-365 - 2022
- [j17]Cédric L. R. Buron, Zahia Guessoum, Sylvain Ductor, Olivier Roussel:
MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo. Rev. Ouverte Intell. Artif. 3(5-6): 645-669 (2022) - [c20]Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel:
Identifying Soft Cores in Propositional Formulæ. ICAART (2) 2022: 486-495 - 2021
- [p2]Olivier Roussel, Vasco Manquinho:
Pseudo-Boolean and Cardinality Constraints. Handbook of Satisfiability 2021: 1087-1129 - 2020
- [j16]Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel:
XCSP3 and its ecosystem. Constraints An Int. J. 25(1-2): 47-69 (2020) - [j15]Olivier Roussel, Pierre Fernbach, Michel Taïx:
Motion Planning for an Elastic Rod Using Contacts. IEEE Trans Autom. Sci. Eng. 17(2): 670-683 (2020)
2010 – 2019
- 2019
- [j14]V. Soni, Abdellah Hadjadj, Olivier Roussel, G. Moebs:
Parallel multi-core and multi-processor methods on point-value multiresolution algorithms for hyperbolic conservation laws. J. Parallel Distributed Comput. 123: 192-203 (2019) - [i5]Christophe Lecoutre, Olivier Roussel:
Proceedings of the 2018 XCSP3 Competition. CoRR abs/1901.01830 (2019) - 2018
- [j13]Andreas Orthey, Olivier Roussel, Olivier Stasse, Michel Taïx:
Motion planning in Irreducible Path Spaces. Robotics Auton. Syst. 109: 97-108 (2018) - [c19]Cédric L. R. Buron, Zahia Guessoum, Sylvain Ductor, Olivier Roussel:
MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo. JFSMA 2018: 85-94 - [i4]Andreas Orthey, Olivier Roussel, Olivier Stasse, Michel Taïx:
Motion Planning in Irreducible Path Spaces. CoRR abs/1809.05322 (2018) - [i3]Cédric L. R. Buron, Zahia Guessoum, Sylvain Ductor, Olivier Roussel:
MoCaNA, un agent de n{é}gociation automatique utilisant la recherche arborescente de Monte-Carlo. CoRR abs/1810.06918 (2018) - 2017
- [j12]V. Soni, Olivier Roussel, Abdellah Hadjadj:
On the accuracy and efficiency of point-value multiresolution algorithms for solving scalar wave and Euler equations. J. Comput. Appl. Math. 323: 159-175 (2017) - 2015
- [b1]Olivier Roussel:
Planification de mouvement pour tiges élastiques. (Motion planning for elastic rods ). Paul Sabatier University, Toulouse, France, 2015 - [c18]Olivier Roussel, Andy Borum, Michel Taïx, Timothy Bretl:
Manipulation planning with contacts for an extensible elastic rod by sampling on the submanifold of static equilibrium configurations. ICRA 2015: 3116-3121 - 2014
- [c17]Olivier Roussel, Michel Taïx, Timothy Bretl:
Efficient motion planning for quasi-static elastic rods using geometry neighborhood approximation. AIM 2014: 1024-1029 - [c16]Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel:
Sliced Table Constraints: Combining Compression and Tabular Reduction. CPAIOR 2014: 120-135 - 2013
- [c15]Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Solving WCSP by Extraction of Minimal Unsatisfiable Cores. ICTAI 2013: 915-922 - [c14]Guillaume Saupin, Olivier Roussel, Jérémie Le Garrec:
Robust and Scalable Navmesh Generation. WSCG 2013: 161-170 - [i2]Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Solving WCSP by Extraction of Minimal Unsatisfiable Cores. CoRR abs/1304.5449 (2013) - 2012
- [j11]Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon:
The International SAT Solver Competitions. AI Mag. 33(1): 89-92 (2012) - [j10]Olivier Bodini, Olivier Roussel, Michèle Soria:
Boltzmann samplers for first-order differential specifications. Discret. Appl. Math. 160(18): 2563-2572 (2012) - [j9]Olivier Bodini, Danièle Gardy, Olivier Roussel:
Boys-and-girls Birthdays and Hadamard Products. Fundam. Informaticae 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
- [j8]Olivier Roussel:
Controlling a Solver Execution with the runsolver Tool. J. Satisf. Boolean Model. Comput. 7(4): 139-144 (2011) - 2010
- [j7]Christophe Lecoutre, Olivier Roussel, Marc R. C. van Dongen:
Promoting robust black-box solvers through competitions. Constraints An Int. J. 15(3): 317-326 (2010) - [j6]Olivier Roussel, Kai Schneider:
Coherent Vortex Simulation of weakly compressible turbulent mixing layers using adaptive multiresolution methods. J. Comput. Phys. 229(6): 2267-2286 (2010)
2000 – 2009
- 2009
- [j5]Olivier Roussel, Michèle Soria:
Boltzmann sampling of ordered structures. Electron. Notes Discret. Math. 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 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
- [j4]Margarete O. Domingues, Sônia M. Gomes, Olivier Roussel, Kai Schneider:
An adaptive multiresolution scheme with local time stepping for evolutionary PDEs. J. Comput. Phys. 227(8): 3758-3780 (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). J. Satisf. Boolean Model. Comput. 2(1-4): 103-143 (2006) - [j2]Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT. J. Satisf. Boolean Model. Comput. 2(1-4): 191-200 (2006) - 2004
- [c7]Olivier Roussel:
Another SAT to CSP Conversion. ICTAI 2004: 558-565 - 2000
- [j1]Olivier Roussel, Philippe Mathieu:
The Achievement of Knowledge Bases by Cycle Search. Inf. Comput. 162(1-2): 43-58 (2000) - [c6]Yacine Boufkhad, Olivier Roussel:
Redundancy in Random SAT Formulas. AAAI/IAAI 2000: 273-278
1990 – 1999
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
