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 4 of 4 for “"sparse data structures"”.

  1. Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures

    … near-optimal solutions produce sparser graphs by notincluding all edges. The idea stems from graph spanner algorithms,which produce sparse subgraphs that guarantee near-optimal paths.Existing asymptotically optimal and near-optimal planners, however,include all sampled …

    unr Repository record for Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures (opens in a new tab)

  2. High-performance memory safety - Optimizing the CHERI capability machine

    … and improve on CHERI’s current approach, I use sparse data structures in a hierarchical tag-cache that filters unnecessary memory accesses. I present an in-depth study of this technique through a Python implementation of the hierarchical tag-cache, and also provide a hardware implementation and …

    cambridge Repository record for High-performance memory safety - Optimizing the CHERI capability machine (opens in a new tab)

  3. Runtime support for irregular computation in MPI-based applications

    … network analysis. Due to the irregular and data-dependent communication patterns and sparse data structures involved in those applications, the traditional parallel programming model and runtime need to be carefully designed and implemented in order to accommodate the performance and …

    uiuc Repository record for Runtime support for irregular computation in MPI-based applications (opens in a new tab)

  4. Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices

    lethbridge