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 63 for “"sequential algorithm"”.

  1. Separation index, variable selection and sequential algorithm for cluster analysis

    … how many there are in the data set. We propose a sequential clustering (SEQCLUST) method that produces a sequence of estimated number of clusters based on varying input parameters. The most frequently occurring estimates in the sequence lead to a point estimate of the number of clusters with an …

    ubc Repository record for Separation index, variable selection and sequential algorithm for cluster analysis (opens in a new tab) Download PDF for Separation index, variable selection and sequential algorithm for cluster analysis (opens in a new tab)

  2. A SEQUENTIAL ALGORITHM TO IDENTIFY THE MIXING ENDPOINTS IN LIQUIDS IN PHARMACEUTICAL APPLICATIONS

    The objective of this thesis is to develop a sequential algorithm to determine accurately and quickly, at which point in time a product is well mixed or reaches a steady state plateau, in terms of the Refractive Index (RI). An algorithm using sequential non-linear model fitting and prediction is …

    vcu Repository record for A SEQUENTIAL ALGORITHM TO IDENTIFY THE MIXING ENDPOINTS IN LIQUIDS IN PHARMACEUTICAL APPLICATIONS (opens in a new tab)

  3. Tests for detection of rare variants and gene-environment interaction in cohort and twin family studies

    … We study two such hypotheses by extending a sequential algorithm that was initially proposed to test for genetic main effects of a candidate gene. We first extend the model selection test using the sequential algorithm to a model-averaging test. We use these tests to study how rare variants …

    umn Repository record for Tests for detection of rare variants and gene-environment interaction in cohort and twin family studies (opens in a new tab)

  4. Efficient grid based techniques for solving the weighted region least cost path problem on multicomputers

    … possibilities of developing fast grid parallel algorithms to solve the Weighted Region Least Cost Path problem. Two complimentary steps have been undertaken. First, an efficient sequential algorithm to solve the above problem was developed. the algorithm is a modification of a Gauss-Seidel-like …

    nps Repository record for Efficient grid based techniques for solving the weighted region least cost path problem on multicomputers (opens in a new tab)

  5. Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets

    … for the optimal allocation and a corresponding sequential algorithm for implementation are provided. Various numerical examples demonstrate where and to what extent the proposed allocation differs from competing algorithms. In the context of multivariate normal distributions, we present an …

    vt Repository record for Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets (opens in a new tab)

  6. Efficient Parallel Text Compression on GPUs

    … compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 GHz CPU. We measure match finder time, …

    tamu Repository record for Efficient Parallel Text Compression on GPUs (opens in a new tab)

  7. The design, analysis, and implementation of parallel simulated annealing and parallel genetic algorithms for the composite graph coloring problem

    … in quality. Two stochastic methods, genetic algorithms and simulated annealing, are applied to the CGCP. Both methods are implemented for MIMD parallel computers. To aid in finding the best parameter settings for the two stochastic methods, a least squares parameter optimization method is …

    must-thes Repository record for The design, analysis, and implementation of parallel simulated annealing and parallel genetic algorithms for the composite graph coloring problem (opens in a new tab)

  8. Collection-and-Delivery-Points: A Variation on a Location-Routing Problem

    … embedded modified vehicle routing problem (VRP) algorithms, the Clark-Wright and the Sweep, modified to handle the additional restrictions caused by the CDPs. The first is an improvement heuristic, in which each closed CDP is tested as a replacement for each open CDP, and the move that creates …

    vt Repository record for Collection-and-Delivery-Points: A Variation on a Location-Routing Problem (opens in a new tab)

  9. Discovery of Temporal Graph Functional Dependencies

    … expertise. Hence, we introduce TGFDMiner, a sequential algorithm that discovers minimal and frequent TGFDs. We define various optimizations for TGFDMiner that improve runtime.

    mcmaster Repository record for Discovery of Temporal Graph Functional Dependencies (opens in a new tab)

  10. Modeling geometric structure in noisy data

    … by the application of efficient clustering algorithms, based on the exploitation of nearest neighbor interactions. A new bi-directional Hebb rule in combination with the LBG algorithm was used to define a connectivity structure among disjoint regions in high-dimensional space. For a lossless …

    colostate Repository record for Modeling geometric structure in noisy data (opens in a new tab)

  11. Scalable Community Detection using Distributed Louvain Algorithm

    … of a network. Louvain is an efficient sequential algorithm but fails to scale emerging large-scale data. Developing distributed-memory parallel algorithms is challenging because of inter-process communication and load-balancing issues. In this work, we design a shared memory-based …

    uno Repository record for Scalable Community Detection using Distributed Louvain Algorithm (opens in a new tab)

  12. Approximate Manifold Sampling: Robust Bayesian Inference for Machine Learning

    … We propose a<br/>novel family of bespoke MCMC algorithms designed to sample efficiently from these densities and<br/>show their computational superiority to general purpose and specialized samplers. Furthermore,<br/>we contribute to the development of integrator and Markov snippets, which are a …

    bristol Repository record for Approximate Manifold Sampling: Robust Bayesian Inference for Machine Learning (opens in a new tab) Download PDF for Approximate Manifold Sampling: Robust Bayesian Inference for Machine Learning (opens in a new tab)

  13. A Direct Synthesis Method for the Conceptual Design of Transport Aircraft

    … design level is considered. A direct sizing algorithm that does not require iteration is developed. Such direct synthesis methods can be used as important building blocks in an aircraft optimization process. New statistical equations based on current aircraft are derived for approximating the …

    embry-riddle Repository record for A Direct Synthesis Method for the Conceptual Design of Transport Aircraft (opens in a new tab)

  14. Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms

    … motivating the necessity of efficient parallel algorithms in various high-performance computing (HPC) platforms. In this dissertation, we present distributed and shared memory parallel algorithms for some important network analytic problems. First, we present distributed memory parallel …

    vt Repository record for Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms (opens in a new tab)

  15. Speeding up the small progress measures algorithm for parity games using the GPU

    … mu-calculus. The small progress measures (SPM) algorithm by Jurdzinski is originally a sequential algorithm for solving parity games. The nature of this algorithm allows easy parallelization, and previous research has already adapted it to work on multi-core machines. Here, SPM is adapted to …

    eindhoven Repository record for Speeding up the small progress measures algorithm for parity games using the GPU (opens in a new tab) Download PDF for Speeding up the small progress measures algorithm for parity games using the GPU (opens in a new tab)

  16. Parallelization techniques for scientific and engineering applications and implementation of the boundary element method (BEM)

    … several techniques for parallelization of sequential algorithms and for optimization of parallel programs;An existing formal technique for transforming a sequential algorithm into a systolic architecture is presented. This dissertation then discusses how a parallel systolic algorithm on a …

    iastate Repository record for Parallelization techniques for scientific and engineering applications and implementation of the boundary element method (BEM) (opens in a new tab)

  17. Robust Optimization for Airline Scheduling and Vehicle Routing

    … solution methods. The first solution method is a sequential algorithm that solves a series of deterministic SPPRC. The second is a modified label-setting algorithm that uses a new dominance rule. Numerical testing shows that the modified label-setting algorithm outperforms the sequential algorithm …

    waterloo Repository record for Robust Optimization for Airline Scheduling and Vehicle Routing (opens in a new tab)

  18. Topics in combinatorial and computational geometry

    … using geometric sampling techniques, we give algorithms for three similar problems: (4) Computing the intersection of halfspaces in $\IR\sp3$; (5) computing the intersection of balls of equal radius in $\IR\sp3$; and (6) computing the Voronoi diagram of line segments in $\IR\sp2$; in each case …

    uiuc Repository record for Topics in combinatorial and computational geometry (opens in a new tab)

  19. A fast multiple longest common subsequence (MLCS) algorithm

    … of strings. In this thesis, we present a new algorithm for the general case of multiple LCS (or MLCS) problem, i.e., finding a LCS of any number of strings, and its parallel realization. The algorithm is based on the dominant point approach and employs a fast divide and- conquer technique to …

    missouri Repository record for A fast multiple longest common subsequence (MLCS) algorithm (opens in a new tab)

  20. Mining Rare Features in Fingerprints using Core points and Triplet-based Features

    A fingerprint matching algorithm with a novel set of matching parameters based on core points and triangular descriptors is proposed to discover rarity in fingerprints. The algorithm uses a mathematical and statistical approach to discover rare features in fingerprints which provides scientific …

    vt Repository record for Mining Rare Features in Fingerprints using Core points and Triplet-based Features (opens in a new tab)

Page 1 of 4