We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Many optimization problems can be expressed us ing some form of soft constraints, where different measures of desirability arc associated with differ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
Abstract—While prior research has extensively evaluated the performance advantage of moving from a 2D to a 3D design style, the impact of process parameter variations on 3D desig...