2814 search results - page 31 / 563 » Competitive Analysis of Distributed Algorithms |
113
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
120
click to vote
COR
2006
15 years 2 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
106
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
119
click to vote
IWEC
2010
15 years 3 months ago
2010
In this paper we present a detailed analysis of World of Warcraft virtual team collaboration. A number of competitive synchronous virtual teams were investigated in-situ and unobtr...
103
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active a...