Sciweavers

1950 search results - page 335 / 390
» Two Abstractions for Distributed Systems of Mobile Nodes
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
126
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
Analysis of Adaptive Incentive Protocols for P2P Networks
— Incentive protocols play a crucial role to encourage cooperation among nodes in networking applications. The aim of this paper is to provide a general analytical framework to a...
Ben Q. Zhao, John C. S. Lui, Dah-Ming Chiu
153
Voted
GISCIENCE
2008
Springer
186views GIS» more  GISCIENCE 2008»
15 years 5 months ago
Detecting Topological Change Using a Wireless Sensor Network
Dynamic geographic phenomena, such as forest fires and oil spills, can have dire environmental, sociopolitical, and economic consequences. Mitigating, if not preventing such events...
Christopher Farah, Cheng Zhong, Michael F. Worboys...
CONCUR
2010
Springer
15 years 5 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
DCOSS
2006
Springer
15 years 8 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...