Olivier Roussel

Orcid: 0000-0001-9709-2404

According to our database1, Olivier Roussel authored at least 44 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Compressing UNSAT CDCL Trees with Caching.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
Compressing UNSAT Search Trees with Caching.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

2022
MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo.
ROIA, 2022

Identifying Soft Cores in Propositional Formulæ.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

2021
Pseudo-Boolean and Cardinality Constraints.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2020
Motion Planning for an Elastic Rod Using Contacts.
IEEE Trans Autom. Sci. Eng., 2020

XCSP<sup>3</sup> and its ecosystem.
Constraints An Int. J., 2020

2019
Parallel multi-core and multi-processor methods on point-value multiresolution algorithms for hyperbolic conservation laws.
J. Parallel Distributed Comput., 2019

Proceedings of the 2018 XCSP3 Competition.
CoRR, 2019

2018
Motion planning in Irreducible Path Spaces.
Robotics Auton. Syst., 2018

MoCaNA, un agent de n{é}gociation automatique utilisant la recherche arborescente de Monte-Carlo.
CoRR, 2018

2017
On the accuracy and efficiency of point-value multiresolution algorithms for solving scalar wave and Euler equations.
J. Comput. Appl. Math., 2017

2015
Planification de mouvement pour tiges élastiques. (Motion planning for elastic rods ).
PhD thesis, 2015

Manipulation planning with contacts for an extensible elastic rod by sampling on the submanifold of static equilibrium configurations.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2014
Sliced Table Constraints: Combining Compression and Tabular Reduction.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Efficient motion planning for quasi-static elastic rods using geometry neighborhood approximation.
Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2014

2013
Robust and Scalable Navmesh Generation.
Proceedings of the 21st International Conference in Central Europe on Computer Graphics, 2013

Solving WCSP by Extraction of Minimal Unsatisfiable Cores.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012
Boys-and-girls Birthdays and Hadamard Products.
Fundam. Informaticae, 2012

Boltzmann samplers for first-order differential specifications.
Discret. Appl. Math., 2012

The International SAT Solver Competitions.
AI Mag., 2012

WCSP Integration of Soft Neighborhood Substitutability.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Propagating Soft Table Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Behind the Scene of Solvers Competitions: the "evaluation" Experience.
Proceedings of the 1st International Workshop on Comparative Empirical Evaluation of Reasoning Systems, 2012

2011
Controlling a Solver Execution with the runsolver Tool.
J. Satisf. Boolean Model. Comput., 2011

2010
Coherent Vortex Simulation of weakly compressible turbulent mixing layers using adaptive multiresolution methods.
J. Comput. Phys., 2010

Promoting robust black-box solvers through competitions.
Constraints An Int. J., 2010

2009
Pseudo-Boolean and Cardinality Constraints.
Proceedings of the Handbook of Satisfiability, 2009

Boltzmann sampling of ordered structures.
Electron. Notes Discret. Math., 2009

XML Representation of Constraint Networks: Format XCSP 2.1
CoRR, 2009

New Encodings of Pseudo-Boolean Constraints into CNF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Failed Value Consistencies for Constraint Satisfaction.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
An adaptive multiresolution scheme with local time stepping for evolutionary PDEs.
J. Comput. Phys., 2008

A Decomposition Technique for Max-CSP.
Proceedings of the ECAI 2008, 2008

2006
The First Evaluation of Pseudo-Boolean Solvers (PB'05).
J. Satisf. Boolean Model. Comput., 2006

A Translation of Pseudo Boolean Constraints to SAT.
J. Satisf. Boolean Model. Comput., 2006

2004
Another SAT to CSP Conversion.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

2000
The Achievement of Knowledge Bases by Cycle Search.
Inf. Comput., 2000

Redundancy in Random SAT Formulas.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1997
Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel.
Proceedings of the JFPLC'97, 1997

Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case.
Proceedings of the Automated Deduction, 1997

1996
Une nouvelle méthode de compilation logique: l'achèvement par cycles.
Proceedings of the JFPLC'96, 1996

A New Method for Knowledge Compilation: The Achievement by Cycle Search.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
Évaluation des méthodes d'achèvement par parties.
Proceedings of the JFPLC'95, 1995


  Loading...