Mueller, Ronnie (2006) Queuing local solutions in distributed constraint satisfaction systems , When solving Distributed Constraint Satisfaction Problems (DCSP), it is desirable that the search exploits asynchronism as much as possible so that the employed agents can perform much of the work in parallel to utilize the processing power available in a distributed environment. However, in many of todays DCSP algorithms only a few agents are working at any given time and the others are idling. This is caused by the fact that once an