Résumé Dans cet article, nous montrons comment une combinaison de stratégies de
branchement et de redémarrages pour la recherche en profondeur d'abord (DFS) permet de …

ABSTRACT Many algorithms for Distributed Constraints Satisfaction Problem (DisCSP)
resolution use additional links between variables not connected by constraints. This causes …

In this paper, we propose mechanisms to improve instantiation heuristics by incorporating
weighted factors on variables. The proposed weight-based heuristics are evaluated on …

Le formalisme" Problème de Satisfaction de Contraintes"(ou CSP pour Constraint
Satisfaction Problem) peut être considéré comme un langage de représentation formelle qui …

This paper presents a general purpose methodology to derive new heuristics for constraint
satisfaction problems using the information contained in an auxiliary graph. The method is …

Untitled Page 1 Page 2 INSTITUTO TECNOLÓGICO Y DE ESTUDIOS SUPERIORES DE
MONTERREY CAMPUS MONTERREY SCHOOL OF ENGINEERING AND INFORMATION …

Much work has been done on learning from failure in search to boost solving of
combinatorial problems, such as clause-learning and clause-weighting in boolean …

Comme nous avons pu le voir dans le chapitre 4, la plupart des algorithmes de recherche
hybride utilisent principalement une recherche en profondeur d'abord avec retour arrière …

Given the breadth of constraint satisfaction problems (CSPs) and the wide variety of CSP
solvers, it is often very difficult to determine a priori which solving method is best suited to a …

Abstract Constraint Satisfaction Problems (CSPs) and Propositional Satisfiability (SAT) are
two closely related frameworks used for solving hard combinatorial problems. Despite their …