Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...