Comparing performance of distributed constraints processing algorithms Academic Article uri icon


  • ABSTRACT 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 checks are performed concurrently by all agents on the network and therefore a simple measurement of constraints checks is not adequate any …

publication date

  • July 16, 2002