2084 search results - page 330 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
JAL
2008
14 years 9 months ago
2008
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
TCS
2008
14 years 9 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...