Sciweavers

169 search results - page 1 / 34
» Decentralized Search with Random Costs
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 10 months ago
Decentralized Search with Random Costs
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...
Oskar Sandberg
AP2PC
2004
Springer
14 years 4 months ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
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...
HICSS
2005
IEEE
110views Biometrics» more  HICSS 2005»
14 years 4 months ago
A Trust-based Negotiation Mechanism for Decentralized Economic Scheduling
Abstract— This paper presents a decentralized negotiation protocol for cooperative economic scheduling in a supply chain environment. For this purpose we designed autonomous agen...
Tim Stockheim, Oliver Wendt, Michael Schwind
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
14 years 4 months ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— 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...
Paul G. Flikkema
WAW
2007
Springer
105views Algorithms» more  WAW 2007»
14 years 5 months ago
Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, Ning Chen, Ravi Kumar, David Libe...