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 59 for “"Sequential Algorithms"”.

  1. Parallel techniques for construction of trees and related problems

    … most fundamental notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods which seem to be inherently sequential. One of the contributions of this thesis is the introduction of several parallel …

    ubc Repository record for Parallel techniques for construction of trees and related problems (opens in a new tab) Download PDF for Parallel techniques for construction of trees and related problems (opens in a new tab)

  2. Scalable Parallel Simulation of General Electrical Circuits

    … power of computing platforms, which allow the sequential algorithms used in circuit simulation to perform at a faster rate. Recently, however, these performance improvements are no longer obtained through the improvement of individual processors, but rather by including more processors in the …

    carleton Repository record for Scalable Parallel Simulation of General Electrical Circuits (opens in a new tab)

  3. Logical foundations of database transformations for complex-value databases

    … been used for the characterisation of sequential algorithms. The sequential Abstract State Machine (ASM) thesis captures semantics and behaviour of sequential algorithms. The thesis uses the similarity of general computations and database transformations for characterisation of the …

    cau-kiel Repository record for Logical foundations of database transformations for complex-value databases (opens in a new tab)

  4. The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems

    … we mainly concentrate on the implementation of sequential and parallel algorithms for solving block bidiagonal linear system arising from the discretization of boundary value problems for linear ordinary differential equations. It consists of two parts. In Part I, several sequential algorithms, …

    ubc Repository record for The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems (opens in a new tab) Download PDF for The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems (opens in a new tab)

  5. Sequential and distributed algorithms for fast graph partitioning

    … is minimized. We propose some simple and fast algorithms for this problem for both sequential and distributed computing environments. We give three main algorithms for graph partitioning: direct algorithm AUC­TION; and iterative algorithms GREEDYPASS and GREEDYCYCLE. In the al­gorithm AUCTION, …

    uvic Repository record for Sequential and distributed algorithms for fast graph partitioning (opens in a new tab)

  6. Optimal power flow via quadratic modeling

    … OPF approaches exhibit shortcomings. Current OPF algorithms can be classified into (a) nonlinear programming, (b) intelligent search methods, and (c) sequential algorithms. Nonlinear programming algorithms focus on the solution of the Kuhn-Tucker conditions; they require a starting feasible …

    gatech Repository record for Optimal power flow via quadratic modeling (opens in a new tab)

  7. SOLVING COMPUTATIONAL GEOMETRY PROBLEMS ON MESH-CONNECTED COMPUTERS

    Parallel algorithms to solve several computational geometric problems on mesh-connected computers (MCC's) and systolic arrays are designed and analyzed. We present parallel MCC algorithms to solve the following proximity problems. Given a set of n planar points represented by their Cartesian …

    rice Repository record for SOLVING COMPUTATIONAL GEOMETRY PROBLEMS ON MESH-CONNECTED COMPUTERS (opens in a new tab)

  8. Market Basket Analysis Algorithm with MapReduce Using HDFS

    … compute huge volumes of data, moreover existing sequential algorithms can be converted in to MapReduce framework for big data. This paper presents a Market Basket Analysis (MBA) algorithm with MapReduce on Hadoop to generate the complete set of maximal frequent item sets. The algorithm is to sort …

    ndsu Repository record for Market Basket Analysis Algorithm with MapReduce Using HDFS (opens in a new tab)

  9. Classification of the Most Commonly Used Adaptive Algorithms and Their Extension to Multidimensional Variable Step Size Sequential Adaptive Algorithms

    … it is shown that the commonly used adaptive algorithms are closely related to each other and can be derived from one another. Progressing from one algorithm to the next, the gradual transition in the tradeoff between the computational complexity, the length of the processed data record, and …

    ucf Repository record for Classification of the Most Commonly Used Adaptive Algorithms and Their Extension to Multidimensional Variable Step Size Sequential Adaptive Algorithms (opens in a new tab)

  10. Optimization algorithms for multidimensional scaling with city-block distances and their parallelization /

    … with city-block distances. Also, we propose two sequential algorithms and one parallel algorithm for the newly formulated problem. Finally, we present the results of numerical investigations of the proposed algorithms.

    vilnius Repository record for Optimization algorithms for multidimensional scaling with city-block distances and their parallelization / (opens in a new tab)

  11. Optimizavimo algoritmai daugiamatėms skalėms su miesto kvartalo atstumais ir jų lygiagretinimas /

    … with city-block distances. Also, we propose two sequential algorithms and one parallel algorithm for the newly formulated problem. Finally, we present the results of numerical investigations of the proposed algorithms.

    vilnius Repository record for Optimizavimo algoritmai daugiamatėms skalėms su miesto kvartalo atstumais ir jų lygiagretinimas / (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. Distributed stabilizing data structures

    Distributed algorithms aim to achieve better performance than sequential algorithms in terms of time complexity (or asymptotic time complexity) while keeping or lowering the memory requirement (space complexity) in a node. (In sequential algorithms, the memory requirement is the memory requirement …

    unlv Repository record for Distributed stabilizing data structures (opens in a new tab) Download PDF for Distributed stabilizing data structures (opens in a new tab)

  14. Advances in Hydraulic Fracture Simulation - Dynamic and Quasi-static Analysis

    … has been given to improving the coupling algorithms used in these simulations. In many cases, sequential coupling algorithms are preferred over the monolithic approach due to the availability of independent solvers for each subproblem (e.g., independent deformable solid and fluid flow …

    waterloo Repository record for Advances in Hydraulic Fracture Simulation - Dynamic and Quasi-static Analysis (opens in a new tab)

  15. Sequential estimation in statistics and steady-state simulation

    … We develop and evaluate three separate sequential algorithms for the two topics. One major advantage of sequential algorithms is that they allow for careful experimental adjustments as sampling proceeds. Unlike one-step sampling plans, sequential algorithms adapt to different situations …

    gatech Repository record for Sequential estimation in statistics and steady-state simulation (opens in a new tab)

  16. Exemplar-based image inpainting on the GPU applied to 3D video conversion

    … region into the region to be filled. These algorithms are designed to propagate both structure and texture into the fill region. They are brute force algorithms however, and are generally implemented as sequential algorithms to be run on the CPU. In this research, I have effectively mapped …

    uvic Repository record for Exemplar-based image inpainting on the GPU applied to 3D video conversion (opens in a new tab)

  17. 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)

  18. Higher Order Strictness Analysis by Abstract Interpretation Over Finite Domains

    … techniques taken from work on the semantics of sequential programming languages. Using sequential algorithms, we are able to calculate portions of least fixed points of abstract functions without the need to evaluate all of some representation of the fixpoint over the entire argument domain. In …

    glasgow Download PDF for Higher Order Strictness Analysis by Abstract Interpretation Over Finite Domains (opens in a new tab)

  19. Towards efficient nonlinear option pricing

    … their performance compared with using sequential algorithms. These constructed solvers with parallel computing implementations essentially contribute to solving nonlinear problems in finance.

    greenwich Download PDF for Towards efficient nonlinear option pricing (opens in a new tab)

  20. MULTI-CORE PARALLEL GRAPH ALGORITHMS

    … networks, call for fast and scalable analytic algorithms. The shared-memory multicore machine is a prevalent parallel computation model that can handle such volumes of data. Unfortunately, many graph algorithms do not take full advantage of such a parallel model. This thesis focuses on the …

    mcmaster Repository record for MULTI-CORE PARALLEL GRAPH ALGORITHMS (opens in a new tab)

Page 1 of 3