This paper reports the results of an empirical … In many instances the best performance was obtained … [p. 53] The list accessing problem revolves around the … A sequence of requests for items is given … either for insertion of an item, to access … [p. 58] access cost performance … The results obtained in our experiment support the … [CACM 28:404-411 1983]. In all instances [Move-To-Front] outperformed [Transpose]. Also, in the word-based … [Frequency-Count]. … [For byte-based sequences,] in most instance FC significantly outperforms MTF. … [p. 60] Experiment 2: data compression … Surprisingly, the best average compression ratios are obtained … [Move-To-Recent- Item(0), i.e. place after first item requested after last request for accessed item].
Google-1
Google-2
Copyright clearance needed for quotation.