Sciweavers

1434 search results - page 118 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
MOBIHOC
2007
ACM
14 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
USENIX
1993
13 years 11 months ago
AudioFile: A Network-Transparent System for Distributed Audio Applications
AudioFile is a portable, device-independent, network-transparent system for computer audio systems. to the X Window System, it provides an abstract audio device interface with a s...
Jim Gettys, Thoms M. Levergood, Andrew C. Payne, L...
DC
2011
12 years 10 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
IAT
2009
IEEE
14 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...