<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> / Thesis / Master of Science (MSc)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/17749 |
| Date | 03 1900 |
| Creators | Fletcher, Donald R. |
| Contributors | Wood, D., Computation |
| Source Sets | McMaster University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0018 seconds