A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
Abstract— This paper presents a decentralized negotiation protocol for cooperative economic scheduling in a supply chain environment. For this purpose we designed autonomous agen...
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...