Philippe Codognet

Philippe Codognet

Auto-generated profile, based on publicly available information

Philippe Codognet

JFLI, CNRS/Sorbonne University/University of Tokyo

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 July 2014 in Constraints
Verified
Journal Article
Closed access
PDF file
YCYves Caniou
Yves Caniou
PCPhilippe Codognet
Philippe Codognet
FRFlorian Richoux
Florian Richoux
DDDaniel Diaz
Daniel Diaz
SASalvador Abreu
Salvador Abreu

30 April 2024 in International Transactions in Operational Research
Verified
Journal Article
Open access
PCPhilippe Codognet
Philippe Codognet
QUBO (quadratic unconstrained binary optimization) has become the modeling language for quantum annealing and quantum‐inspired annealing solvers. We present different approaches in QUBO for the magic square problem and the quadratic assignment problem (QAP), which can be modeled by linear equations and a permutation constraint over integer variables. Different ways of encoding integers by Booleans in QUBO amount to models, the implementation of which could have very different performance. Experiments performed on the Fixstars Amplify Annealer Engine, a quantum‐inspired annealing solver, show that, compared to the classical one‐hot encoding, using unary encoding for integers performs slightly better for the QAP and much better for magic square.

23 May 2015 in Journal of Heuristics
Verified
Journal Article
Closed access
PDF file
CTCharlotte Truchet
Charlotte Truchet
AAAlejandro Arbelaez
Alejandro Arbelaez
FRFlorian Richoux
Florian Richoux
PCPhilippe Codognet
Philippe Codognet

1 July 2013 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
AAAlejandro Arbelaez
Alejandro Arbelaez
CTCharlotte Truchet
Charlotte Truchet
PCPhilippe Codognet
Philippe Codognet
This paper presents a detailed analysis of the scalability and parallelization of local search algorithms for the Satisfiability problem. We propose a framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequential version. Indeed, by approximating the runtime distribution of the sequential process with statistical methods, the runtime behavior of the parallel process can be predicted by a model based on order statistics. We apply this approach to study the parallel performance of two SAT local search solvers, namely Sparrow and CCASAT, and compare the predicted performances to the results of an actual experimentation on parallel hardware up to 384 cores. We show that the model is accurate and predicts performance close to the empirical data. Moreover, as we study different types of instances (random and crafted), we observe that the local search solvers exhibit different behaviors and that their runtime distributions can be approximated by two types of distributions: exponential (shifted and non-shifted) and lognormal.


26 June 2023
Verified
Book Chapter
Closed access
PDF file
FRFlorian Richoux
Florian Richoux
JBJean-François Baffier
Jean-François Baffier
PCPhilippe Codognet
Philippe Codognet