Message Delays and DisCSP Search Algorithms Academic Article uri icon

abstract

  • The behavior of distributed search algorithms on DisCSPs can be studied on a set of three very different families of DisCSP algorithms. All search algorithms on DisCSPs can be divided into two families: single search process algorithms (SPAs) and concurrent (multiple) search process algorithms (CSAs). The only former experimental study of the performance of DisCSP algorithms compared two asynchronous single search algorithms [4]. The state of single process algorithms is defined by a single tuple of assignments, one for each agent …

publication date

  • January 1, 2008