The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...