735 search results - page 111 / 147 » Randomization in Parallel Stringology |
204
click to vote
EUROPAR
2006
Springer
15 years 10 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...
184
click to vote
GCC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
207
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
206
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
159
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...