Abstract
The problem of designing algorithms in situations where there is some information concerning the typical conditions that are encountered when the respective problem is solved is studied. Adaptability, a new measure for the quality of an algorithm, which generalizes the competitive analysis of Sleator and Tarjan, is introduced. The expressive power of adaptability is demonstrated by presenting a variety of examples in a uniform manner, including results regarding paging in a two-level store, Markov paging, and distributed algorithms for shared memory systems.
| Original language | English (US) |
|---|---|
| Number of pages | 1 |
| DOIs | |
| State | Published - 1997 |
| Event | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA Duration: Aug 21 1997 → Aug 24 1997 |
Other
| Other | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| City | Santa Barbara, CA, USA |
| Period | 8/21/97 → 8/24/97 |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Networks and Communications