Applying interchangeability techniques to the distributed breakout algorithm
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1381-1381.
Abstract
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood partial and full interchangeability techniques to keep conflicts localized and avoid spreading them to neighboring areas. Our experiments on distributed sensor networks show that such techniques can significantly reduce the number of cycles required to solve the problems (therefore also reduce communication and time requirements), especially on difficult problems. Moreover, the improved algorithms are able to solve a higher proportion of the test problems.
@inproceedings{ijcai2003p206,
title = {Applying interchangeability techniques to the distributed breakout algorithm},
author = {Petcu, Adrian and Faltings, Boi},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1381--1381},
year = {2003},
url = {https://ijcai.org/proceedings/2003/206},
}
TY - CPAPER TI - Applying interchangeability techniques to the distributed breakout algorithm AU - Petcu, Adrian AU - Faltings, Boi T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1381 EP - 1381 UR - https://ijcai.org/proceedings/2003/206 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
