| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9650042 | Artificial Intelligence | 2005 | 29 Pages |
Abstract
A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Marius-CÄlin Silaghi, Boi Faltings,