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 20 of 2322 for “"Speed-up"”.

  1. On the Caching Schemes to Speed Up Program Reduction

    … program reduction process inevitably generates duplicate variants, and the number of them can be significant. Our study reveals that on average 62.3% of the generated variants in HDD, a state-of-the-art program reducer, are duplicates. Checking them against ψ is thus redundant and unnecessary, …

    waterloo Repository record for On the Caching Schemes to Speed Up Program Reduction (opens in a new tab)

  2. Computational modelling of enzyme activity to speed up biocatalyst redesign

    … three major approximations were introduced to speed up calculations: starting from a single snapshot, neglecting possible reorganizations consecutive to the mutation and focusing mainly on electrostatic effects. Two different types of charge modification protocols were investigated: charge …

    strathclyde Repository record for Computational modelling of enzyme activity to speed up biocatalyst redesign (opens in a new tab)

  3. Using explanation structures to speed up local-search-based planning

    … planning process. The goal of this thesis is to speed up planning systems that have loose plan structures using local search approaches to create plans. To address the potential inefficiencies, we propose a novel technique that uses explanation structures to retain some causal information …

    nus Repository record for Using explanation structures to speed up local-search-based planning (opens in a new tab) Download file for Using explanation structures to speed up local-search-based planning (opens in a new tab)

  4. Comparative Study of Speed-Up Routing Algorithms in Road Networks

    … In the literature, these algorithms are called speed-up algorithms. More recently, dynamic routing algorithms have been proposed, such as Customizable Contraction Hierarchy and Dynamic Hierarchical Hub Labeling. These are designed to respond efficiently to edge weight changes resulting from …

    concordia Download PDF for Comparative Study of Speed-Up Routing Algorithms in Road Networks (opens in a new tab)

  5. Using Many-Core Computing to Speed Up De Novo Transcriptome Assembly

    … sequencing give only short reads of the mRNA, up to 100 nucleotides. In order to reconstruct the mRNA sequences, one must use an assembly algorithm to stitch these short reads back into full length transcripts. De novo transcriptome assemblers are an important family of transcriptome …

    maryland Repository record for Using Many-Core Computing to Speed Up De Novo Transcriptome Assembly (opens in a new tab)

  6. Investigating methods for the speed-up of intra-lanthanide chromatographic systems

    … gravity-fed column chromatography, which trades speed for purity. However, in nuclear forensic applications, speedy separation methods are essential to backtracking and identifying the origin of nuclear materials quickly. One essential separation for nuclear forensics applications is the …

    colo-mines Repository record for Investigating methods for the speed-up of intra-lanthanide chromatographic systems (opens in a new tab)

  7. Mixed-Initiative tool to speed Up content creation in physics-based games

    … work we introduce a mixed-initiative tool to speed up the process of con- tent generation for physics-based games. Our system uses exhaustive search and computational geometry to allow the game designer to focus on the creative process of content creation by not needing to worry about the …

    brazil-ufv Repository record for Mixed-Initiative tool to speed Up content creation in physics-based games (opens in a new tab)

  8. The Role of Time in Cryptography: Play, Fast Forward, and Speed Up

    … the efficiency of evaluating ideal class group action, which serves as a building block in this area. Delay-based cryptographic primitives, such as time-lock puzzles and verifiable delay functions, play a crucial role in many cryptographic protocols by ensuring that certain computations …

    waterloo Repository record for The Role of Time in Cryptography: Play, Fast Forward, and Speed Up (opens in a new tab)

  9. First-order distributed optimization methods for machine learning with linear speed-up

    … failures and delays. The new results improve upon the prior works by relaxing some of the restrictive assumptions on communication, such as bounded link failures and intercommunication intervals, as well as allowing for message delays. Next, (ii) a Robust Asynchronous Stochastic Gradient Push …

    bu Repository record for First-order distributed optimization methods for machine learning with linear speed-up (opens in a new tab)

  10. Data management without reinstrumentation: How to speed up existing Big Data neuroimaging workflows

    … incorporation of data management strategies, by up to a factor of 5.3X in the most data-intensive case. While we found Big Data frameworks (e.g. Apache Spark) to significantly speedup data-intensive neuroimaging workflows, our analysis on overlay pilot-scheduling with Spark determined that …

    concordia Download PDF for Data management without reinstrumentation: How to speed up existing Big Data neuroimaging workflows (opens in a new tab)

  11. Slowing down to speed up : protecting users against massive attacks in content distribution systems

    The Internet has become a large platform where users can interact and share personal files or third-party productions. Considering the increasing demand for efficient content sharing, modern and robust content distribution systems (CDS) need to be deployed and maintained. In the context of this …

    brazil-ufrgs Repository record for Slowing down to speed up : protecting users against massive attacks in content distribution systems (opens in a new tab)

  12. Use of architectural-level primitives in system-level diagnosis and speed up of test vector generation

    Test generation is an important part of a circuit as the test vectors are used during the design, manufacture, system integration, and throughout the life-cycle of the circuit in order to detect the presence of defects. The very large scale integration (VLSI) test generation problem has been one of …

    uiuc Repository record for Use of architectural-level primitives in system-level diagnosis and speed up of test vector generation (opens in a new tab)

  13. Employing Graphics Processing Unit (GPU) Technology to Speed Up Multi-scale and Multi-resolution Agent-Based Brain Cancer Models

    … of graphics processing unit (GPU) technology to speed up a well developed multi-scale, multi-resolution agent based (MMABM) brain cancer (Glioblastoma multiforme (GBM)) model. The improved cancer model shows great potentiality to simulate real progression of brain cancer cells. MMABM includes …

    mtu Repository record for Employing Graphics Processing Unit (GPU) Technology to Speed Up Multi-scale and Multi-resolution Agent-Based Brain Cancer Models (opens in a new tab)

  14. Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction

    … which computes least or minimal upper bounds. As with unification, anti-unification comes in a variety of forms. The thesis of this dissertation is: anti-unification in its various forms is, like unification, a powerful tool for automated reasoning. In defense of the thesis, …

    uiuc Repository record for Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction (opens in a new tab)

  15. Tree-structured parallel algorithms

    … and asynchronous tree algorithms, and speed-up for this class of algorithms are defined. It is shown that under certain reasonable assumptions the speed-up, in going from a sequential to a parallel execution, is given by the ratio of the number of nodes in the tree to the number of …

    ut-knoxville Repository record for Tree-structured parallel algorithms (opens in a new tab)

  16. Swarm-Based Descent, Efficiency, and Posterior Accuracy with Compressed NAT-Modelled Bayesian Networks

    … an algorithm based on swarm techniques to speed up the compression of a BN into a NAT modelled BN. This algorithm has proven to allow for significant speed up in compression. Next, we investigated the inference performance of multiplicative factorized (MF) NAT modelled BNs for a range of …

    guelph Repository record for Swarm-Based Descent, Efficiency, and Posterior Accuracy with Compressed NAT-Modelled Bayesian Networks (opens in a new tab)

Page 1 of 117