Abstract
dc:description.abstract<p> This investigation examines several methods designed to minimize the computational cost of retrieving records from a binary search tree.</p> <p> No knowledge of the probabilities with which these records are requested is assumed. The aim of each method is to gradually restructure an initial, arbitrary (and perhaps costly) tree into one which has minimal search cost, on the basis of experience.</p> <p> While no one such 'self-organizing' method has yet received theoretical substantiation, it is hoped that this empirial investigation may assist in this endeavour.</p>
Degree
thesis:*- Department dc:contributor.department
- Computation
- Year dc:date.issued
- 1977
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fletcher, Donald R.
- Advisor dc:contributor.advisor
-
- Wood, D.
Subjects
dc:subject × 1Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/16677