The Community for Technology Leaders
Proceedings 35th Annual Symposium on Foundations of Computer Science (1994)
Santa Fe, NM, USA
Nov. 20, 1994 to Nov. 22, 1994
ISBN: 0-8186-6580-7
pp: 394-400
E. Koutsoupias , California Univ., Los Angeles, CA, USA
ABSTRACT
The competitive analysis of on-line algorithms has been criticized as being too crude and unrealistic. We propose two refinements of competitive analysis an two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for on-line decision-making. We illustrate the first with an application to the paging problem; as a by product we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server systems, and the power of visual sensors in robot navigation.
INDEX TERMS
robot navigation, competitive analysis, on-line algorithms, on-line decision-making, paging problem, work functions, k-server problem, lookahead, server systems, visual sensors
CITATION

C. Papadimitriou and E. Koutsoupias, "Beyond competitive analysis [on-line algorithms]," Proceedings 35th Annual Symposium on Foundations of Computer Science(FOCS), Santa Fe, NM, USA, 1994, pp. 394-400.
doi:10.1109/SFCS.1994.365677
87 ms
(Ver 3.3 (11022016))