A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A broad range of AI and multi-Agent problems fall in to the Distributed Constraint Satisfaction Problems category. Many of the problems in this domain are real-world problems. This fact makes DisCSPs an effective area of research. Considering all of the efforts that have recently been accomplished for solving these kinds of the problems, the most successful algorithm proposed is Asynchronous Partial Overlay (APO), which is a mediation-based algorithm. APO tries to solve the problem first byfatcat:s47qgmjrufabze2u4ib5yi27ua