Dynamic pipelining for the loosely-coupled distributed constraint satisfaction problems.

In the distributed constraint satisfaction problems (DCSPs), the elements of the problem, such as variables, domains and constraints, are distributed among a group of agents and thus, communications and coordination are needed for finding a solution. In this work, we consider the situation when the underlying constraint graph of the given DCSP consists of several components which are loosely-coupled (i.e. disconnected or connected via less-restrict constraints), and propose an approach to pipeline the solving processes on each component under the multi-channel wireless communication model.