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 “"disk-based algorithm"”.

  1. Disk Based Model Checking

    <p>Disk based model checking does not receive much attention in the model checking field becasue of its costly time overhead. In this thesis, we present a new disk based algorithm that can get close to or faster verification speed than a RAM based algorithm that has enough memory to complete its …

    byu Repository record for Disk Based Model Checking (opens in a new tab) Download PDF for Disk Based Model Checking (opens in a new tab)

  2. Shortest Path Queries in Very Large Spatial Databases

    … for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient algorithms have been developed recently for graphs with …

    waterloo Repository record for Shortest Path Queries in Very Large Spatial Databases (opens in a new tab)

  3. A Scalable Partial-Order Data Structure for Distributed-System Observation

    … Fidge/Mattern, as needed to capture causality. Algorithms then took advantage of additional properties of these timestamps that are not explicit in the formal semantics. This dissertation defines the data-structure interface precisely, and goes some way toward reworking algorithms in terms of …

    waterloo Repository record for A Scalable Partial-Order Data Structure for Distributed-System Observation (opens in a new tab)