Competitive Analysis of Dynamic Dictionaries and Disk Scheduling Algorithms
碩士 === 國立臺灣大學 === 電機工程學研究所 === 88 === In this thesis, we study two on-line problems. The first one is the on-line dictionary problem. An implementation of dynamic dictionaries based on binomial trees is provided. The move-to-front heuristic is proven to be 3-competitive for the tree updat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33985293047201216252 |