Abstract
Self-organizing heuristics are presented for data structures containing elements with different weights (access probabilities). The structures use just a constant number of locations in addition to those required for the values of the elements, and support average access times that are within a constant multiplicative factor of optimal. Data structures and corresponding heuristics with essentially optimal average unsuccessful search times are also given for the case in which there are probabilities of access associated with the intervals between consecutive element values.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
