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 23 for “"algorithm engineering"”.
-
Algorithm engineering : string processing
… in the design and analysis of string matching algorithms. To date, most of this work has been based on the asymptotic analysis of the algorithms. This analysis rarely tell us how the algorithm will perform in practice and considerable experimentation and fine-tuning is typically required to get …
-
Performance-Driven Algorithm Engineering
… computing requires applications and algorithms to scale with the growing levels of parallelism. However, highly optimised algorithms are often embedded within applications, making them practically inaccessible to the scientific community. In this dissertation, we first investigate a …
-
Algorithm Engineering for some Complex Practise Problems
This work deals with the design of exact algorithms and heuristics for complex optimization problems that origin from three practical applications and one classical combinatorial task. We obtain exact algorithms by modeling our problems in terms of mathematical optimization problems and applying …
-
Improving Simulation Performance With Gpus
Simulations are indispensable for engineering. They make it possible that one can perform faster and cheaper virtual experiments than physical ones on virtual environments based on numerical methods. One key factor to the performance of a simulation system is the speed of solving linear equations …
-
Theory and applications of bio-inspired algorithms.
Evolutionary algorithms, which form a sub-class of bio-inspired algorithms, mimic some fundamental aspects of the neo-Darwinian evolutionary process. They simultaneously search with a population of candidate solutions and associate an objective score as a fitness value for each one. The algorithms …
-
Efficient error-tolerant search on large text collections
… we propose e cient data structures and algorithms that are the core of our fuzzy search. In the second part, we address important algorithm-engineering aspects of an error-tolerant search system. All of our algorithms and data structures have been implemented and integrated into the …
-
Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms
… of this genomic data is a big challenge to the algorithm design as well as the high performance computing society. There are many problems in Bioinformatics, such as how new functional genes arise, why genes are organized into chromosomes, how species are connected through the evolutionary tree …
-
Efficient distance computations of VLMCs in DNA sequencing
… to utilizing a cache-oblivious matrix transpose algorithm, which we call matrix recursion when constructing a matrix of distances between VLMCs. The data structure, Hash map, attains a speedup of up to 19 times compared to the state-of-the-art when computing all distances between 15 446 VLMCs …
-
On the design of architecture-aware algorithms for emerging applications
… and also presents architecture-aware algorithms for different systems. The kernels and applications discussed in this dissertation have widely varying computational characteristics. For example, we consider both dense numerical computations and sparse graph algorithms. This …
-
High-dimensional polytopes defined by oracles: algorithms, computations and applications
… a fundamental role in disciplines of science and engineering. The last decades many successful geometric algorithms has been developed in 2 and 3 dimensions. However, in most cases their performance in higher dimensions is poor. This behavior is commonly called the curse of dimensionality. A …
-
Fast-sparse-spanner: A practical algorithm for constructing low-stretch sparse geometric graphs
… simple and practical (fast and memory-efficient) algorithm named Fast-Sparse-Spanner algorithm for constructing sparse low stretch-factor geometric graphs on large pointsets in the plane. To the best of current knowledge, this is the first practical algorithm capable of constructing fast low …
-
Operation and Calibration Procedures for a Small Four-component Strain Gage Balance
The Florida Technological University four-component strain-gage balance is an internally mounted, half-inch diameter balance capable of measuring four components of load: front and rear normal force, axial force, and rolling moment. Measurement of these components is accomplished by means of …
-
Constrained Nonlinear Heuristic-Based MPC for Control of Robotic Systems with Uncertainty
… model predictive control (NEMPC), a control algorithm previously developed by Phil Hyatt of the BYU RaD Lab. While this controller and its variants are applicable to any high degree-of-freedom (DoF) robotic system, particular emphasis is given in this thesis to control of a soft robot …
-
Multi-vehicle Dispatching And Routing With Time Window Constraints And Limited Dock Capacity
… Second, a Probabilistic Route Generation (PRG) algorithm is applied to each cluster to find the best route for visiting customers by each vehicle; multiple routes per vehicle are generated and each route is associated with a set of feasible dispatching times from the depot. Third, an assignment …
-
A Novel Privacy Disclosure Risk Measure and Optimizing Privacy Preserving Data Publishing Techniques
… measure to develop our novel “RU Generalization” algorithm that anonymizes a sensitive dataset to be able to publish the data for public access while preserving the privacy of individuals in the dataset. The challenge is to preserve privacy without incurring excessive information loss. Our RU …
-
Spline-Based Contact: Algorithms and Applications
… been a major bottleneck of the computer aided engineering workflow. One promising alternative field of study, intended to address this challenge, is called the immersed finite element method. In this method, the original CAD domain is immersed in a rectilinear grid called the background mesh. …
-
A Study on Integrated Transportation and Facility Location Problem
… Relaxation Heuristic (LRH) and a Hybrid Genetic Algorithm (GA) solution of the FCSLTP are presented as alternative solutions. Comparative studies between the FCSTP and the FCSLTP formulation are also presented. The LRH is demonstrated with a numerical example and also extended to hopefully …
Page 1 of 2