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 “"tree traversals"”.

  1. Parallelizing Tree Traversals for Binomial Option Pricing

    … quantitative analysis tools include binomial trees, which are useful to represent possible future model states and estimate the current value of an asset. Open-source libraries such as QuantLib provide tools to help analysts implement such algorithsms without needing to reinvent widely studied …

    mit Repository record for Parallelizing Tree Traversals for Binomial Option Pricing (opens in a new tab)

  2. Automatically Optimizing Tree Traversal Algorithms

    … and traverse complex data structures like trees and graphs. As irregular applications operate on ever larger datasets, their performance suffers from poor locality and parallelism. Programmers are burdened with the arduous task of manually tuning such applications for better performance. …

    purdue-thes Repository record for Automatically Optimizing Tree Traversal Algorithms (opens in a new tab)

  3. GPU-enhanced power flow analysis

    … load-balancing, for implementing the so-called treefix operations; (ii) a study of the impact of the representation format over performance and accuracy, for fuzzy interval algebraic operations; and (iii) the utilization of architecture-specific design, as a novel strategy to improve performance …

    liege Repository record for GPU-enhanced power flow analysis (opens in a new tab)