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

  1. Multi-tree algorithms for computational statistics and phyiscs

    The Fast Multipole Method of Greengard and Rokhlin does the seemingly impossible: it approximates the quadratic scaling N-body problem in linear time. The key is to avoid explicitly computing the interactions between all pairs of N points. Instead, by organizing the data in a space-partitioning …

    gatech Repository record for Multi-tree algorithms for computational statistics and phyiscs (opens in a new tab)

  2. Global Optimization of Large-Scale Complex Nonlinear Systems: Algorithms and Applications

    … can be extremely difficult to solve. Efficient algorithms, especially global solution strategies, for MINLP problems play important roles in many real-world applications. Although a number of optimization tools have been developed for general MINLP problems, their performance may vary …

    purdue-thes Repository record for Global Optimization of Large-Scale Complex Nonlinear Systems: Algorithms and Applications (opens in a new tab)

  3. Generalized N-body problems: a framework for scalable computation

    … in scaling out an extensible class of simple algorithms to even hundreds of thousands of nodes. However, there are some tasks---even embarrassingly parallelizable ones---that neither MapReduce nor any existing automated parallelization framework is well-equipped to perform. For instance, any …

    gatech Repository record for Generalized N-body problems: a framework for scalable computation (opens in a new tab)