212 search results - page 8 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
139
click to vote
ORL
2008
15 years 4 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
148
click to vote
DAGSTUHL
1996
15 years 7 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
152
click to vote
ICDCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
158
click to vote
SOFSEM
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
150
click to vote
FOCS
2004
IEEE
15 years 9 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...