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 56 for “"Graph Algorithm"”.

  1. Efficient graph algorithm execution on data-parallel architectures

    … for improving the execution efficiency of graph algorithms on Data-Parallel Architectures were proposed and identified. Execution of graph algorithms on GPGPU architectures, the prevalent data-parallel architectures was considered. Irregular and data dependent accesses in graph algorithms …

    gatech Repository record for Efficient graph algorithm execution on data-parallel architectures (opens in a new tab)

  2. Modified tree graph algorithm for ultimate pit limit analysis

    Includes bibliographical references.

    colo-mines Repository record for Modified tree graph algorithm for ultimate pit limit analysis (opens in a new tab)

  3. Implementation of algorithms for sorting by strip swaps using alternating cycle graphs

    … et al., targeting the refinement of their cycle graph algorithm for sorting by strip swaps. The main contribution of this thesis is the development of a solution that successfully handles the various scenarios of sorting by strip swaps on which the cycle graph algorithm of Roy et al. did not …

    unf Repository record for Implementation of algorithms for sorting by strip swaps using alternating cycle graphs (opens in a new tab) Download PDF for Implementation of algorithms for sorting by strip swaps using alternating cycle graphs (opens in a new tab)

  4. Otimização da rota de linhas de transmissão utilizando uma metodologia de avaliação multicritério

    … project implementation costs. In the work, Geographic Information Systems (GIS) tools are used to obtain the matrices of each evaluated criterion. For the multicriteria analysis, the AHP technique is used to determine the weights of the criteria considered (Alachated Areas, Permanent …

    brazil-uerj Repository record for Otimização da rota de linhas de transmissão utilizando uma metodologia de avaliação multicritério (opens in a new tab)

  5. Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction

    … design</p> <p>flow. In this thesis we present an algorithm to route a</p> <p>multi-terminal net in the presence of obstacles. Ours is a top down</p> <p>approach which includes partitioning the initial solution into</p> <p>subproblems and using obstacle aware version of Fast Lookup Table based …

    iastate Repository record for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction (opens in a new tab)

  6. A reduced visibility graph approach for motion planning of autonomously guided vehicles

    … static and dynamic environments.<br/><br/>Two algorithms are proposed for solving the aforementioned problems. The first algorithm establishes the shortest collision-semi-free path for an AGV from its start point to its goal point, in a two-dimensional static environment populated by simple …

    southwales Repository record for A reduced visibility graph approach for motion planning of autonomously guided vehicles (opens in a new tab) Download PDF for A reduced visibility graph approach for motion planning of autonomously guided vehicles (opens in a new tab)

  7. Transaction management in mobile multidatabases.

    … mobile user. A new Partial Global Serialization Graph algorithm is introduced to verify the isolation property of global transactions. This algorithm verifies the serializability of a global transaction by constructing a partial global serialization graph. This algorithm relies on the propagation …

    oklahoma-thes Repository record for Transaction management in mobile multidatabases. (opens in a new tab)

  8. Algorithms and interface enhancements for GraphEd

    <p>Graph editors can be a powerful visualization tool for research. A good editor allows the user to create, display, and manipulate graphs. Researchers demand many different things in such a tool. It may be difficult to find an implementation that is flexible enough and simple enough to assist in …

    ut-knoxville Repository record for Algorithms and interface enhancements for GraphEd (opens in a new tab)

  9. Hinted Data Structures with Applications to Optimization and Learning

    … the interplay among data structures, graph algorithms, and machine learning, providing a fresh lens on conventional perspectives concerning worst-case scenarios and data structure performance. The thesis is divided into two main parts. The first part delves into the concept of Low …

    gatech Repository record for Hinted Data Structures with Applications to Optimization and Learning (opens in a new tab)

  10. A Graph-Theoretic Approach to Model Genomic Data and Identify Biological Modules Asscociated with Cancer Outcomes

    … This dissertation examines the capacity of graph-theoretical methods to model and analyze genomic information and thus facilitate using prior knowledge to create a more discrete and functionally relevant feature space. To assess the statistical and computational value of graph-based …

    washington Repository record for A Graph-Theoretic Approach to Model Genomic Data and Identify Biological Modules Asscociated with Cancer Outcomes (opens in a new tab)

  11. Quantum Query Complexity of Hypergraph Search Problems

    … finding triangles and spanning trees in a simple graph. Over the past decades, many techniques are developed for finding the upper and lower quantum query bounds of these graph problems. We can generalize these problems to detecting certain properties of higher rank hypergraphs and ask whether …

    waterloo Repository record for Quantum Query Complexity of Hypergraph Search Problems (opens in a new tab)

  12. Distributed computing in dynamic and faulty networks: distributed graph algorithms and multidimensional agreement

    The study of distributed graph algorithms is central in both theoretical and applied computer science research, from solving large-scale graph problems via parallel computation models to designing fault-tolerant protocols in networks. Graphs can be dataset abstractions or even representations of …

    aalto Repository record for Distributed computing in dynamic and faulty networks: distributed graph algorithms and multidimensional agreement (opens in a new tab)

  13. A Complete Subgoal Graph Method for Ultra-Fast Pathfinding

    … on octile grids, called the Complete Subgoal Graph algorithm (CSG). This algorithm has much faster preprocessing times than similar algorithms, and also slightly faster online runtimes. The biggest drawback is that it requires a relatively large amount of memory, although this memory …

    anu Repository record for A Complete Subgoal Graph Method for Ultra-Fast Pathfinding (opens in a new tab)

  14. QuasiNovo: Algorithms for De Novo Peptide Sequencing

    … are generated via a dynamic programming graph algorithm, and then scored using a combination of the neural network score, the amino acid usage score, and an edge frequency score. In addition to a complete de novo peptide sequencer, we also examine the use of amino acid usage models …

    south-carolina Repository record for QuasiNovo: Algorithms for De Novo Peptide Sequencing (opens in a new tab)

  15. Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield

    … in the direction of a PSO solution location, a graph-based method is implemented. This encompasses the second area of research. The graph algorithm runs in O(n^3) time and consumes less than 0.2% of the total measured computation time to find a solution. Transmitter location updates prompt a …

    iupui Repository record for Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield (opens in a new tab)

  16. ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion

    … operations. Typical data race detection algorithms compute the happens-before relation either by tracking the order that shared accesses happen via a vector clock counter, or by grouping events into sets that help classify which heap locations are accessed sequentially or in parallel. …

    byu Repository record for ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion (opens in a new tab) Download PDF for ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion (opens in a new tab)

  17. An enhanced Web robot for the CINDI system

    … to the classification; a revised context graph algorithm and a special tunneling strategy are employed to increase recall; URL ordering policies are set up to sort all crawling web pages. Other heuristics obtained during the experimental stage are also incorporated into the final version …

    concordia Download PDF for An enhanced Web robot for the CINDI system (opens in a new tab)

  18. Spectral Analysis of Randomly Generated Networks With Prescribed Degree Sequences

    … relies on a mathematical structure called a graph. Having seen its early beginnings in the 1950's, the field has seen a surge of interest over the last two decades, attracting interest from a range of scientists including computer scientists, sociologists, biologists, physicists, and …

    south-carolina Repository record for Spectral Analysis of Randomly Generated Networks With Prescribed Degree Sequences (opens in a new tab)

  19. Large-scale graph algorithms and applications with an emphasis on fintech data

    <p>Graph algorithms are essential analytical tools with applications spanning cybersecurity, biology, social media, and increasingly, financial technology (FinTech). The complex and interconnected nature of financial data, particularly in cryptocurrency networks, presents unique opportunities for …

    njit Repository record for Large-scale graph algorithms and applications with an emphasis on fintech data (opens in a new tab)

Page 1 of 3