Comparing performance of distributed constraints processing algorithms


Search algorithms on distributed constraints satisfaction problems, DisCSPs, are composed of agents performing computations concurrently. The most common abstract performance measurement that has been universally adopted for centralized CSPs algorithms is the number of constraints checks performed. However, when it comes to distributed search, constraints… (More)


4 Figures and Tables


Citations per Year

216 Citations

Semantic Scholar estimates that this publication has 216 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics