248 search results - page 20 / 50 » New On-Line Algorithms for the Page Replication Problem |
128
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
134
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
144
Voted
LCPC
1997
Springer
15 years 8 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
88
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...
154
click to vote
PODC
2009
ACM
16 years 28 days ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...