Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
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.
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011