28 citations · 51 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
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…
An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming
John O. R. Aoga, Tias Guns, Pierre Schaus
The main advantage of Constraint Programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular exp…