F
Fred Hemery
Researcher at Centre national de la recherche scientifique
Publications - 25
Citations - 1077
Fred Hemery is an academic researcher from Centre national de la recherche scientifique. The author has contributed to research in topics: Constraint satisfaction & Local consistency. The author has an hindex of 11, co-authored 25 publications receiving 1036 citations. Previous affiliations of Fred Hemery include Johns Hopkins University & university of lille.
Papers
More filters
Proceedings Article
Boosting systematic search by weighting constraints
TL;DR: A dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (CSP) and which avoids some trashing by first instantiating variables involved in the constraints that have frequently participated in dead-end situations.
Journal ArticleDOI
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
TL;DR: A formal analysis shows that it is possible to generate forced satisfiable instances whose hardness is similar to unforced satisfiable ones.
Proceedings Article
A study of residual supports in arc consistency
Christophe Lecoutre,Fred Hemery +1 more
TL;DR: It is proved that AC3rm (AC3 with multi-directional residues) is optimal for low and high constraint tightness, and experimental results clearly show that exploiting residues allows enhancing MAC and SAC algorithms.
Proceedings Article
A simple model to generate hard satisfiable instances
TL;DR: In this paper, the authors further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest, and show that it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances.
Proceedings ArticleDOI
Backjump-based techniques versus conflict-directed heuristics
TL;DR: A general algorithm which gives a uniform view of several state-of-the-art systematic backtracking search algorithms for solving both binary and nonbinary CSP instances and studies the interest of backjump-based techniques with respect to conflict-directed variable ordering heuristics.