Sciweavers

4208 search results - page 346 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
140
Voted
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
15 years 10 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
HIPC
1999
Springer
15 years 9 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
DSN
2007
IEEE
15 years 8 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski
DCOSS
2006
Springer
15 years 8 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni
INFOCOM
2009
IEEE
15 years 11 months ago
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
Yao Zhao, Zhaosheng Zhu, Yan Chen, Dan Pei, Jia Wa...