Sciweavers

2814 search results - page 31 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICPP
1998
IEEE
14 years 2 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
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...
Mahesh Kallahalla, Peter J. Varman
COR
2006
122views more  COR 2006»
13 years 10 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
CP
2007
Springer
14 years 4 months ago
: The Design and Analysis of an Algorithm Portfolio for SAT
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...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
IWEC
2010
13 years 11 months ago
Virtual Team Performance Depends on Distributed Leadership
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...
Nico M. van Dijk, Joost Broekens
FOCS
2004
IEEE
14 years 1 months ago
Optimal Power-Down Strategies
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...
John Augustine, Sandy Irani, Chaitanya Swamy