2084 search results - page 154 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
155
Voted
COLOGNETWENTE
2009
15 years 6 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
161
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
134
Voted
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
117
click to vote
QUESTA
2010
15 years 3 months ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
170
click to vote
HIPEAC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...