702 search results - page 69 / 141 » Algorithms for Minimizing Response Time in Broadcast Schedul... |
EVOW
2003
Springer
15 years 3 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational an...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
ECCC
2000
14 years 9 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...