735 search results - page 79 / 147 » Randomization in Parallel Stringology |
127
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
110
click to vote
ICPPW
2009
IEEE
15 years 9 months ago
2009
IEEE
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...
91
Voted
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. BitTorrent users and consumer ISPs are often pictured as having opposite interests, with end-users aggressively trying to improve their download times, while ISPs throttl...
119
click to vote
PDP
2008
IEEE
15 years 8 months ago
2008
IEEE
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
107
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...