Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"list update"”.

  1. Learning to Update: Using Reinforcement Learning to Discover Policies for List Update

    … to the task of discovering an algorithm for the list update problem. The list update problem is a classic problem with applications in caching and databases. In the process of uncovering a new list update algorithm, we also prove a competitive ratio for the transposition heuristic, which is a …

    mit Repository record for Learning to Update: Using Reinforcement Learning to Discover Policies for List Update (opens in a new tab)

  2. Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem

    … are some of the many algorithms used on the List Update problem. In 1985, Competitive Analysis first showed the superiority of Move-To-Front over Transpose and Frequency Count for the List Update problem with arbitrary data. Earlier studies due to Bitner assumed independent identically …

    unt Repository record for Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem (opens in a new tab)

  3. New Analytical Methods for Online Binary Search Trees

    … counting, a popular potential function for list updates that has not been used in a BST context. An inversion potential function is arguably the most natural potential function, as it captures the difference between the states of two different algorithms. We illustrate our techniques in the …

    aalto Repository record for New Analytical Methods for Online Binary Search Trees (opens in a new tab)