Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
We consider a problem of decentralized exploration of a faulty network by several simple, memoryless agents. The model we adopt for a network is a directed graph. We design an asynchronous algorithm that can cope with failures of network edges and nodes. The algorithm is self-stabilizing in the sense that it can be started with arbitrary initializations and scalable -new agents can be added while other agents are already running.
Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Miao Guo, Yong Tao Pei, et al.
WCITS 2011