Sciweavers

528 search results - page 105 / 106
» Structured Communication in Single Hop Sensor Networks
Sort
View
ATAL
2010
Springer
13 years 7 months ago
Decentralized hash tables for mobile robot teams solving intra-logistics tasks
Although a remarkably high degree of automation has been reached in production and intra-logistics nowadays, human labor is still used for transportation using handcarts and forkl...
D. Sun, A. Kleiner, Christian Schindelhauer
TON
1998
90views more  TON 1998»
13 years 5 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 8 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
PODC
2006
ACM
14 years 6 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 10 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