activity
20152019
most citedVerification of railway interlocking systems

28 citations · 34 across the 3 of their papers we have counts for

collaborators

8 papers

cs.LG2019

An aggregate learning approach for interpretable semi-supervised population prediction and disaggregation using ancillary data

Guillaume Derval, Frédéric Docquier, Pierre Schaus

Census data provide detailed information about population characteristics at a coarse resolution. Nevertheless, fine-grained, high-resolution mappings of population counts are incr…

cs.NI2017

REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms

Steven Gay, Pierre Schaus, Stefano Vissicchio

In this paper, we propose a pragmatic approach to improve reproducibility of experimental analyses of traffic engineering (TE) algorithms, whose implementation, evaluation and comp…

stat.ML20172 cited

Mining a Sub-Matrix of Maximal Sum

Vincent Branders, Pierre Schaus, Pierre Dupont

Biclustering techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients.…

cs.AI20174 cited

A Visual Web Tool to Perform What-If Analysis of Optimization Approaches

Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus

In Operation Research, practical evaluation is essential to validate the efficacy of optimization approaches. This paper promotes the usage of performance profiles as a standard pr…

cs.AI2016

Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets

Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre +4

In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table con- straints. Although this algorithm is the default propa…

cs.AI2016

Parallel Strategies Selection

Anthony Palmieri, Jean-Charles Régin, Pierre Schaus

We consider the problem of selecting the best variable-value strategy for solving a given problem in constraint programming. We show that the recent Embarrassingly Parallel Search…