International audienceThe contribution of this paper is twofold. On the one hand, it introduces a concept of FAC variables in discrete Constraint Satisfaction Prob- lems (CSPs). FAC variables can be discovered by local search techniques and powerfully exploited by MAC-based methods. On the other hand, a novel syn- ergetic combination schema between local search paradigms, generalized arc- consistency and MAC-based algorithms is presented. By orchestrating a multiple- way flow of information between these various fully integrated search compo- nents, it often proves more competitive than the usual techniques on most classes of instances
International audienceWe propose a generic, domain-independent local search method called adaptive s...
International audienceA variable elimination rule allows the polynomialtime identification of certai...
dans le cadre de CP'08International audienceThis paper describes the three main improvements made to...
International audienceThis paper is concerned with local search techniques (LS) for solving CSPs (Co...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constr...
We proposed several practical techniques aimed at solving the NP-complete Constraint Satisfaction Pr...
International audienceIn the last years, the application of local search techniques for constraint s...
In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems (CSP). It p...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
grantor: University of TorontoThe Constraint Satisfaction Problem (CSP) is an NP-complete ...
We here propose a generic, domain-independent local search method called adaptive search for solvin...
International audienceWe propose a generic, domain-independent local search method called adaptive s...
International audienceWe propose a generic, domain-independent local search method called adaptive s...
International audienceA variable elimination rule allows the polynomialtime identification of certai...
dans le cadre de CP'08International audienceThis paper describes the three main improvements made to...
International audienceThis paper is concerned with local search techniques (LS) for solving CSPs (Co...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constr...
We proposed several practical techniques aimed at solving the NP-complete Constraint Satisfaction Pr...
International audienceIn the last years, the application of local search techniques for constraint s...
In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems (CSP). It p...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
grantor: University of TorontoThe Constraint Satisfaction Problem (CSP) is an NP-complete ...
We here propose a generic, domain-independent local search method called adaptive search for solvin...
International audienceWe propose a generic, domain-independent local search method called adaptive s...
International audienceWe propose a generic, domain-independent local search method called adaptive s...
International audienceA variable elimination rule allows the polynomialtime identification of certai...
dans le cadre de CP'08International audienceThis paper describes the three main improvements made to...