Sciweavers

1265 search results - page 217 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 1 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
GLOBECOM
2009
IEEE
14 years 2 months ago
Impact of Social Networks on Delay Tolerant Routing
Abstract—Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low d...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
TON
2010
136views more  TON 2010»
13 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
MOBICOM
2003
ACM
14 years 28 days ago
Range-free localization schemes for large scale sensor networks
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
Tian He, Chengdu Huang, Brian M. Blum, John A. Sta...