Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
With the emergence of fast and standardized communication infrastructures over which separately designed agents of different organizations can interact in real-time, there is an i...
Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings wh...
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...