Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking''

Abstract : The asynchronous backtracking algorithm with dynamic ordering (ABT DO), proposed in a 2006 paper, allows changing the order of agents during distributed asynchronous complete search. In a later 2009 study, retroactive heuristics which allowed more flexibility in the selection of new orders were introduced, resulting in the ABT DO-Retro algorithm, and a relation between the success of heuristics and the min-domain property was identified. Unfortunately, the description of the time-stampping protocol used to compare orders in ABT DO-Retro is confusing and may lead to an implementation in which ABT DO-Retro may not terminate. In this corrigen- dum, we demonstrate the possible undesired outcome and give a detailed and formal description of the correct method for comparing time-stamps in ABT DO-Retro.
Type de document :
Article dans une revue
Constraints, Springer Verlag, 2012, 17, pp.348-355
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00748174
Contributeur : Joël Quinqueton <>
Soumis le : lundi 5 novembre 2012 - 09:15:52
Dernière modification le : jeudi 11 janvier 2018 - 06:26:23
Document(s) archivé(s) le : mercredi 6 février 2013 - 03:53:39

Fichier

constraints12-corrigendum.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00748174, version 1

Collections

Citation

Younes Mechqrane, Mohamed Wahbi, Christian Bessière, El Houssine Bouyakhf, Amnon Meisels, et al.. Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking''. Constraints, Springer Verlag, 2012, 17, pp.348-355. 〈lirmm-00748174〉

Partager

Métriques

Consultations de la notice

221

Téléchargements de fichiers

191