Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/17749
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Wood, D. | - |
dc.contributor.author | Fletcher, Donald R. | - |
dc.date.accessioned | 2015-07-15T18:48:26Z | - |
dc.date.available | 2015-07-15T18:48:26Z | - |
dc.date.issued | 1977-03 | - |
dc.identifier.uri | http://hdl.handle.net/11375/17749 | - |
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> | en_US |
dc.language.iso | en_US | en_US |
dc.subject | self-organizing, binary search trees, computational | en_US |
dc.title | An Investigation of Self-Organizing Binary Search Trees | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Computation | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Master of Science (MSc) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fletcher_Donald_R._1977Mar_Masters..pdf | 3.74 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.