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 19 of 19 for “"Generic Algorithms"”.

  1. Generic Flow Algorithm for Analysis of Interdependent Multi-Domain Distributed Network Systems

    … object-oriented modeling concepts to model algorithms in a generic manner for solving interconnected, multi-domain problems. This work is based on an extension of Graph Trace Analysis (GTA) which was originally developed in the 1990's for power distribution system design. Because of GTA's …

    vt Repository record for Generic Flow Algorithm for Analysis of Interdependent Multi-Domain Distributed Network Systems (opens in a new tab)

  2. Techniques in Active and Generic Software Libraries

    … in the Standard Template Library, allowing generic algorithms to find the most suitable traversal through a container, allowing (in one case) a 30-fold improvement in performance; the development of techniques, idioms, and best practices for concepts and concept maps in C++, allowing the …

    tamu Repository record for Techniques in Active and Generic Software Libraries (opens in a new tab)

  3. Sustainable optimization of supply chains - A global shift in logistics view on social, economic, and environmental sustainability

    … of supply chain optimization was used such as generic algorithms to improve lead times and quality and lateral collaboration to tighten the supply chain. Interviews were conducted with employees of different levels at a single global LSP to get practical input from the industry. A theoretical …

    chalmers Repository record for Sustainable optimization of supply chains - A global shift in logistics view on social, economic, and environmental sustainability (opens in a new tab)

  4. Automated Explicit Formula Generation for Hyperelliptic Curve Jacobian Arithmetic

    … 4 from prior work. Our formulas outper-form the generic algorithms of Cantor’s addition and NUCOMP in terms of runtime, and require comparable operation counts against manually fine-tuned formulas for limited small genera.

    calgary Repository record for Automated Explicit Formula Generation for Hyperelliptic Curve Jacobian Arithmetic (opens in a new tab)

  5. Algorithms for operations on probability distributions in a computer algebra system

    … their work at a conceptual level. The design of generic algorithms for tedious computations allows modelers to push current modeling boundaries outward more quickly.;Probability theory, with its many theorems and symbolic manipulations of random variables is a discipline in which automation of …

    wm-mary Repository record for Algorithms for operations on probability distributions in a computer algebra system (opens in a new tab)

  6. A Unified Robust Minimax Framework for Regularized Learning Problems

    … analysis techniques, and inspiring novel generic algorithms. To show how to apply minimax related concepts to real-world learning tasks, we develop a new fault-tolerant classification framework to combat class noise for general multi-class classification problems; further, by studying the …

    siu-theses Repository record for A Unified Robust Minimax Framework for Regularized Learning Problems (opens in a new tab)

  7. Graph-based divide-and-conquer techniques for binary diffing

    … program partitioning and applies binary diffing algorithms using a divide-and-conquer strategy, implemented in an extensible binary diffing pipeline. Specifically, we introduce three novel program partitioning techniques; (i) a method combining consensus-based Louvain community detection on …

    greece Repository record for Graph-based divide-and-conquer techniques for binary diffing (opens in a new tab)

  8. Stochastic transport models in confined networked environments

    … Through analysis of the equilibration time, algorithms for optimal network construction are designed and tested. Additionally, we explore search processes for multiple interacting searchers within a networked environment. Quantifying the efficiency of the search process via the parallel cover …

    oxford Repository record for Stochastic transport models in confined networked environments (opens in a new tab)

  9. Parallel Program Composition with Paragraphs in Stapl

    … programming library for C++ that adopts the generic programming philosophy of the C++ Standard Template Library. STAPL provides collections of parallel algorithms (pAlgorithms) and containers (pContainers) that allow a developer to write their application without reimplementing the algorithms …

    tamu Repository record for Parallel Program Composition with Paragraphs in Stapl (opens in a new tab)

  10. DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques

    … Artificial Intelligence planning and re-planning algorithms as part of their solution. There is a lack of algorithms created specifically for DIS purposes since most DIS systems use generic algorithms, and they do not usually assess if and why a given algorithm is the best solution for their …

    liverpool-jm Repository record for DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques (opens in a new tab) Download PDF for DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques (opens in a new tab)

  11. Contributions to Monte Carlo Search

    … where we automatically generate several MCS algorithms from a list of core components upon which most MCS algorithms are built upon and compare them to generic algorithms. The results show that it often enables discovering new variants of MCS that significantly outperform generic MCS …

    liege Repository record for Contributions to Monte Carlo Search (opens in a new tab) Download PDF for Contributions to Monte Carlo Search (opens in a new tab)

  12. Decision support for new and renewable energy systems deployment

    … enhanced to allow the full analysis described. Generic algorithms have been developed to allow the behaviour of a comprehensive list of plant types and methods for producing derived fuels to be modelled, which require only available process and manufacturers' data. The program is flexible, …

    strathclyde Repository record for Decision support for new and renewable energy systems deployment (opens in a new tab)

  13. Towards Sparse IMU Sensor-Based Estimation of Walking Kinematics, Joint Moments, and Ground Reaction Forces in Multiple Locomotion Modes via Deep Learning

    … them impractical for daily use, and the use of generic algorithms limits their accuracy. As a result, learning kinematics and kinetics in everyday life outside of laboratory settings is challenging. Thus, there is a need for an inexpensive, near-real-time system and an accurate method for …

    ucf Repository record for Towards Sparse IMU Sensor-Based Estimation of Walking Kinematics, Joint Moments, and Ground Reaction Forces in Multiple Locomotion Modes via Deep Learning (opens in a new tab)

  14. Scalable compiler optimizations for improving the memory system performance in multi- and many-core processors

    … and hardware prefetching, and propose generic algorithms implementable in production compilers for a range of processors.(2) We propose wise heuristics in a cost model to choose good statements to fuse, and also improve dependence analysis to not loose critical fusion opportunity in …

    umn Repository record for Scalable compiler optimizations for improving the memory system performance in multi- and many-core processors (opens in a new tab)

  15. Local Minima in Mixture Problems and their Algorithmic Implications

    … landscape allows for the global convergence of generic algorithms for solving the maximum likelihood estimator (MLE), such as gradient descent (GD) and the expectation-maximization (EM) algorithm. In particular, the iterates exhibit the following dynamics: (1) the l2 distance to a true parameter …

    cornell Repository record for Local Minima in Mixture Problems and their Algorithmic Implications (opens in a new tab)

  16. Shortest path queries on polyhedral sufaces and in polygonal domains

    … and computational geometry.We present novel algorithms that answer approximate shortest path queries between any pair of points lying on a polyhedral surface P consisting of n positively weighted triangular faces. The cost of a path, denoted by ||π||, in P is defined as ||π| |= Σni=1wi|πi|, …

    carleton Repository record for Shortest path queries on polyhedral sufaces and in polygonal domains (opens in a new tab)

  17. Understanding conflict-resolution taskload: implementing advisory conflict-detection and resolution algorithms in an airspace

    … of conflict-detection and resolution algorithms. Specifically, the research presented here examines a metric of controller taskload: how many resolution commands an air traffic controller issues under the guidance of a conflict-detection and resolution decision-support tool. The goal …

    gatech Repository record for Understanding conflict-resolution taskload: implementing advisory conflict-detection and resolution algorithms in an airspace (opens in a new tab)

  18. Distributed learning in large populations

    … conducive to distributed learning? Are there any generic algorithms offering non-trivial performance guarantees for a large class of models? The first half of this thesis makes contributions to two particular problems in distributed learning, self-assembly and language. Self-assembly refers to the …

    gatech Repository record for Distributed learning in large populations (opens in a new tab)