Sciweavers

974 search results - page 164 / 195
» Formal Modeling of Communication Traces
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 3 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ETFA
2006
IEEE
15 years 3 months ago
Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
William D. Henderson, Steven Tron
MOBIHOC
2007
ACM
15 years 11 months ago
Allocating dynamic time-spectrum blocks in cognitive radio networks
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend...
Yuan Yuan, Paramvir Bahl, Ranveer Chandra, Thomas ...
INFOCOM
2009
IEEE
15 years 6 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
ICDCS
2007
IEEE
15 years 5 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta