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 70 for “"finding algorithms"”.

  1. Validation of Case-finding Algorithms Derived from Health Administrative Data for Identifying Neonatal Bacterial Sepsis

    … in the true-positive cohort. Potential coding algorithms were developed based on different combinations of ICD-10-CA codes on the hospitalization discharge abstract. For Objective 2, the coding algorithm with the most optimal characteristics was applied to provincial data to calculate incidence …

    ottawa-retro Repository record for Validation of Case-finding Algorithms Derived from Health Administrative Data for Identifying Neonatal Bacterial Sepsis (opens in a new tab)

  2. Newton's Method

    Root-finding algorithms have been studied for ages for their various applications. Newton's Method is just one of these root-finding algorithms. This report discusses Newton's Method and aims to describe the procedures behind the method and to determine its capabilities in finding the zeros for …

    texas Repository record for Newton's Method (opens in a new tab)

  3. Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences

    … of TFBS problem is also referred as motif finding problem in computer science. Despite extensive efforts in the past decade, none of the existing algorithms perform very well. This dissertation focuses on this difficult problem and proposes three new methods (MotifEnumerator, PosMotif, and …

    tamu Repository record for Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences (opens in a new tab)

  4. Analyse de réseaux et intégration d'une approche déductive aux systèmes d'information géographique : l'exemple du transport routier des matières dangereuses.

    … and more specifically the problem of safe path finding for the transportation of dangerous goods. Most of the path finding algorithms use impedance as a unique variable for optimisation. This approach is limited, especially in the domain of dangerous goods, where quantitative and qualitative …

    ottawa-retro Repository record for Analyse de réseaux et intégration d'une approche déductive aux systèmes d'information géographique : l'exemple du transport routier des matières dangereuses. (opens in a new tab)

  5. Extensions and applications of the A* algorithm

    In this thesis we investigate path finding problems, that is, planning routes from a start node to some goal nodes in a graph. Such problems arise in many fields of technology, for example, production planning, energy-aware message routing in large networks, resource allocation, and vehicle …

    aalto Repository record for Extensions and applications of the A* algorithm (opens in a new tab)

  6. Delay-tolerant Multi-Agent Path Finding: Delay-tolerant methods for solving multi-agent path finding problems in autonomous systems

    Multi-agent path finding algorithms find collision-free paths that agents should follow according to a schedule. The schedules found by multi-agent path finding algorithms are strict, meaning that when a robot in an autonomous system is delayed and fall behind schedule, the schedule is invalidated …

    chalmers Repository record for Delay-tolerant Multi-Agent Path Finding: Delay-tolerant methods for solving multi-agent path finding problems in autonomous systems (opens in a new tab)

  7. Homologous Gene Finding with a Hidden Markov Model

    The homology search problem and the gene finding problem are two fundamental problems in bioinformatics. The homology search problem is to find the homologous regions of two biological sequences; the gene finding problem is to find all the genes in both strands of a genomic sequence. Recently, gene …

    waterloo Repository record for Homologous Gene Finding with a Hidden Markov Model (opens in a new tab)

  8. Homologous Gene Finding with a Hidden Markov Model

    The homology search problem and the gene finding problem are two fundamental problems in bioinformatics. The homology search problem is to find the homologous regions of two biological sequences; the gene finding problem is to find all the genes in both strands of a genomic sequence. Recently, gene …

    waterloo Repository record for Homologous Gene Finding with a Hidden Markov Model (opens in a new tab)

  9. On the Construction, Maintenance and Analysis of Case-Based Strategies in Computer Poker

    … the the advancement of bottom up equilibrium finding algorithms via computational game theory. On the other hand, alternative top down approaches, that attempt to generalise decisions observed within a collection of data, have not received as much attention. In this thesis we examine top down …

    auckland-ms Repository record for On the Construction, Maintenance and Analysis of Case-Based Strategies in Computer Poker (opens in a new tab)

  10. Enhanced Spatial Smoothing and Coprime Array for Direction of Arrival Estimation

    … and to enhance the performance of direction finding algorithms. In this regard, in order to identify more sources than the antennas, coprime array was recently proposed. Also, there are several direction finding algorithms which have been used extensively. One of them is the Multi-Signal …

    buffalo Repository record for Enhanced Spatial Smoothing and Coprime Array for Direction of Arrival Estimation (opens in a new tab)

  11. Structured numerical problems in contemporary applications

    … the diagonal elements are prescribed. We present algorithms that are capable of generating a larger set of these constructions than previous algorithms. We also discuss the existence of equiangular tight frames---frames that satisfy additional structural properties. Kernel learning is an important …

    texas Repository record for Structured numerical problems in contemporary applications (opens in a new tab)

  12. Fast galactic structure finding using graphics processing units

    … formation and galaxy evolution. Structure finding, that is, the discovery of gravitationally-bound objects such as dark matter halos, is a crucial step in many such simulations. During recent years, advancing computational capacity has lead to halo-finders needing to manage increasingly …

    cape-town Repository record for Fast galactic structure finding using graphics processing units (opens in a new tab)

  13. Newton's method and the effect of damping on the basins of attraction

    … author investigates how this workhorse of root-finding algorithms works for complex polynomials, in addition to a variety of other settings, from the simple, one-dimensional real function with a simple root, to the infinite-dimension Banach space. The rapid, quadratic convergence of Newton's …

    iastate Repository record for Newton's method and the effect of damping on the basins of attraction (opens in a new tab)

  14. A Biclustering Approach to Combinatorial Transcription Control

    … transcription factors bind. Conventional motif finding algorithms fail to address this issue. We propose a novel biclustering algorithm based on random sampling to identify candidate binding site combinations. We establish bounds on the various parameters to the algorithm and study the …

    vt Repository record for A Biclustering Approach to Combinatorial Transcription Control (opens in a new tab)

  15. Computations to Obtain Wider Tunnels in Protein Structures

    Finding wide tunnels in protein structures is an important problem in Structural Bioinformatics with applications in various areas such as drug design. Several algorithms have been proposed for finding wide tunnels in a fixed protein conformation. However, to the best of our knowledge, none of the …

    waterloo Repository record for Computations to Obtain Wider Tunnels in Protein Structures (opens in a new tab)

  16. Iterative methods for roots of polynomials

    We describe iterative methods for polynomial zero finding and, specifically, the Laguerre method and how it is used in the NAG subroutine C02AFF. We also investigate a bug that has been in this subroutine for ten years. In chapter two, we give a brief survey of some zero finding methods. These …

    oxford Repository record for Iterative methods for roots of polynomials (opens in a new tab)

  17. Generating Peptide Mass Spectrometry Ground Truth Data

    … lack of tools for enabling the manual feature finding necessary to generate this data. Other lacks the ability to capture, edit, save, and view precursor mass spectrometry data. We present JS-MS 2.0, a software suite that provides a dependency-free, browser-based, one click, cross-platform …

    montana Repository record for Generating Peptide Mass Spectrometry Ground Truth Data (opens in a new tab)

  18. Generating Peptide Mass Spectrometry Ground Truth Data

    … lack of tools for enabling the manual feature finding necessary to generate this data. Other lacks the ability to capture, edit, save, and view precursor mass spectrometry data. We present JS-MS 2.0, a software suite that provides a dependency-free, browser-based, one click, cross-platform …

    montana-tech Repository record for Generating Peptide Mass Spectrometry Ground Truth Data (opens in a new tab)

  19. Error Analysis of Angle and Range Estimation in a Range Limited Antenna System Using Music and Modified Root Pisarenko Algorithms

    … each made up of several elements, direction-finding algorithms such as MUSIC and Modified Root Pisarenko (MRP) are used to estimate the angles of arrival of incoming signals. Using the estimated angles of arrival, a range estimation algorithm is used to estimate the distance of the emitter …

    vt Repository record for Error Analysis of Angle and Range Estimation in a Range Limited Antenna System Using Music and Modified Root Pisarenko Algorithms (opens in a new tab)

Page 1 of 4