543 search results - page 59 / 109 » A Randomized Parallel Sorting Algorithm with an Experimental... |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
TR
2010
13 years 2 months ago
2010
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
CCGRID
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a method to optimize the timeout value of computing jobs. It relies on a model of the job execution time that considers the job management system latency throu...