@inbook{aa8858c9e47b43b5b6af62ec80c93897,
title = "A general framework for reordering agents asynchronously in distributed CSP",
abstract = "Reordering agents during search is an essential component of the efficiency of solving a distributed constraint satisfaction problem. Termination values have been recently proposed as a way to simulate the min-domain dynamic variable ordering heuristic. The use of termination values allows the greatest flexibility in reordering agents dynamically while keeping polynomial space. In this paper, we propose a general framework based on termination values for reordering agents asynchronously. The termination values are generalized to represent various heuristics other than min-domain. Our general framework is sound, complete, terminates and has a polynomial space complexity. We implemented several variable ordering heuristics that are well-known in centralized CSPs but could not until now be applied to the distributed setting. Our empirical study shows the significance of our framework compared to state-of-the-art asynchronous dynamic ordering algorithms for solving distributed CSP.",
author = "Mohamed Wahbi and Younes Mechqrane and Christian Bessiere and Brown, \{Kenneth N.\}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 ; Conference date: 31-08-2015 Through 04-09-2015",
year = "2015",
doi = "10.1007/978-3-319-23219-5\_33",
language = "English",
isbn = "9783319232188",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "463--479",
editor = "Gilles Pesant",
booktitle = "Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings",
address = "Germany",
}