Sciweavers

6300 search results - page 1093 / 1260
» We have it easy, but do we have it right
Sort
View
TMC
2008
91views more  TMC 2008»
15 years 1 months ago
Efficient and Resilient Backbones for Multihop Wireless Networks
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
Seungjoon Lee, Bobby Bhattacharjee, Aravind Sriniv...
TPDS
2008
175views more  TPDS 2008»
15 years 1 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 1 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
MICRO
2002
IEEE
156views Hardware» more  MICRO 2002»
15 years 1 months ago
TCP Switching: Exposing Circuits to IP
There has been much discussion about the best way to combine the benefits of new optical circuit switching technology with the established packet switched Internet. In this paper,...
Pablo Molinero-Fernández, Nick McKeown
RSA
2008
94views more  RSA 2008»
15 years 26 days ago
The cycle structure of two rows in a random Latin square
Let L be chosen uniformly at random from among the latin squares of order n 4 and let r, s be arbitrary distinct rows of L. We study the distribution of r,s, the permutation of t...
Nicholas J. Cavenagh, Catherine S. Greenhill, Ian ...
« Prev « First page 1093 / 1260 Last » Next »