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 104 for “"Breadth first search"”.

  1. A Faster Breadth-First Search on Sparse Graphs

    Breadth-First Search (BFS) is a widely used graph processing algorithm with applications in many areas. State-of-the-art parallel BFS algorithms use a levelsynchronous approach which explores the graph level by level, with a synchronization barrier between each level. The level-synchronous approach …

    chalmers Repository record for A Faster Breadth-First Search on Sparse Graphs (opens in a new tab)

  2. Theory and techniques for synthesizing efficient breadth-first search algorithms

    … algorithm schemas. For example, the Global Search schema generalizes traditional branch-and-bound search, and includes both depth-first and breadth-first strategies. Algorithm development involves systematic specialization of the algorithm schema based on problem-specific constraints to …

    texas Repository record for Theory and techniques for synthesizing efficient breadth-first search algorithms (opens in a new tab)

  3. Breadth-first search for social network graphs on heterogenous platforms

    DSpace SAF Submission Ingestion Package generated from Vireo submission #9220 on 2016-07-07 at 13:30:40

    uiuc Repository record for Breadth-first search for social network graphs on heterogenous platforms (opens in a new tab)

  4. Persistent search: a bridge between depth-first and breadth-first search for physical agents.

    Current search algorithms and heuristics perform very poorly in the highly realistic scenario of a physical agent traversing an initially unknown search space. They do not attempt to minimize the amount of movement required by the physical agent attempting to reach a desired goal location. In order …

    nps Repository record for Persistent search: a bridge between depth-first and breadth-first search for physical agents. (opens in a new tab)

  5. Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs

    This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches …

    toronto-retro Repository record for Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs (opens in a new tab)

  6. Exploiting balanced trees in the computation of elementary flux modes via breadth-first search

    … of their precious metabolic by-products, we must first understand the metabolic pathways that lead from a starting material (e.g., glucose) to a metabolic product (e.g., hydrogen). Given a set of reactions, elementary flux modes can be used to mathematically define all metabolic pathways that are …

    rice Repository record for Exploiting balanced trees in the computation of elementary flux modes via breadth-first search (opens in a new tab)

  7. Implementation of Breadth-First Search Method Based on a Randomly Chosen Bottom Clause for Inductive Logic Programming Method

    … for data and rules that are represented in first-order predicate logic [Muggleton]. ILP methods mostly use logic programming as a uniform representation language for examples, background knowledge and hypotheses. Background knowledge holds the information about the language used to describe …

    umn Repository record for Implementation of Breadth-First Search Method Based on a Randomly Chosen Bottom Clause for Inductive Logic Programming Method (opens in a new tab)

  8. On End Vertices of Search Algorithms

    … of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be the end (last) vertex of a search …

    uvic Repository record for On End Vertices of Search Algorithms (opens in a new tab)

  9. Connected Domination in Graphs

    … connected dominating set D. We present the breadth first search algorithm as a heuristic for finding a connected dominating set whose cardinality is hopefully close to that of a minimum connected dominating set. The algorithm finds a spanning tree T of the graph G = (V, E) using breadth …

    usf Repository record for Connected Domination in Graphs (opens in a new tab)

  10. Path exploration during code navigation

    Previous research in computer science shows that developers spend a large fraction of their time navigating through source code. Improving developers’ effectiveness in navigating code thus should yield significant productivity improvements. Pre vious research in a number of fields suggests that a …

    ubc Repository record for Path exploration during code navigation (opens in a new tab) Download PDF for Path exploration during code navigation (opens in a new tab)

  11. UNIPARSE: a universal parser

    … a Universal Turing Machine and utilizes bounded Breadth-First search and development techniques to evaluate Type O languages.

    nps Repository record for UNIPARSE: a universal parser (opens in a new tab)

  12. Demonstrační program simulace zásobníkových automatů

    … umělé inteligence - prohledávání do šířky - Breadth First Search.

    brno-tech Repository record for Demonstrační program simulace zásobníkových automatů (opens in a new tab)

  13. Connectedness Properties of Self-Similar Graphs

    … about the existence of the optimal depth for the breadth-first search algorithm and also has possible applications to the recent research topics in Psychological and Brain Sciences. We approach the connectedness problem by showing the similarity of obtained geometric structures to well known …

    ottawa-retro Repository record for Connectedness Properties of Self-Similar Graphs (opens in a new tab)

  14. Scheduling Irregular Workloads on GPUs

    This doctoral research aims at understanding the nature of the overhead for data irregular GPU workloads, proposing a solution, and examining the consequences of the result. We propose a novel, retry-free GPU workload scheduler for irregular workloads. When used in a Breadth First Search (BFS) …

    mississippi Repository record for Scheduling Irregular Workloads on GPUs (opens in a new tab)

  15. Inducing Grammar from Sparse Data Sets

    … state-of-the-art solutions leverage a depth-first search strategy, which is an evidence based state merging strategy or a breadth-first search strategy. We propose two solutions. The first uses a simulation-based approach that samples the set of deterministic finite state automata that …

    guelph Repository record for Inducing Grammar from Sparse Data Sets (opens in a new tab)

  16. Accelerating Monte Carlo Tree Search for discrete action grand strategy games

    … player, the dominant costs are move generation, breadth-first search over maps, and repeated state cloning. This reduces the iterations for effective search in the time budget. Sequential Monte Carlo Tree Search addresses the move generation problem by decomposing the action space per territory, …

    gatech Repository record for Accelerating Monte Carlo Tree Search for discrete action grand strategy games (opens in a new tab)

  17. Teorie grafů - implementace vybraných problémů

    … vyhledávání v grafech pomocí metod DFS (Depth First Search) a BFS (Breadth First Search). Dále potom hledání nejkratší cesty za pomoci specifických algoritmů jako jsou: Dijkstrův algoritmus, Floyd-Warshallův algoritmus a Bellman-Fordův algoritmus. Poslední část je věnována problematice …

    brno-tech Repository record for Teorie grafů - implementace vybraných problémů (opens in a new tab)

  18. Parallelization of formal concept analysis algorithms

    … means of computing formal concepts in several research papers. In this thesis key enhancements to the original CbO algorithms are discussed in detail. The effects of these key features are presented in both isolation and combination. Eight different variations of the CbO algorithms highlighting …

    sheffield-hallam Repository record for Parallelization of formal concept analysis algorithms (opens in a new tab) Download PDF for Parallelization of formal concept analysis algorithms (opens in a new tab)

  19. Decontamination of arbitrary networks with multiple mobile agent home bases

    In this thesis we consider the problem of searching for an intruder in arbitrary networks. A team of mobile software agents is deployed to capture the intruder (i.e., a virus) and decontaminate the network. These agents follow a common protocol, derived from the Breadth-First Search (BFS) …

    ottawa-retro Repository record for Decontamination of arbitrary networks with multiple mobile agent home bases (opens in a new tab)

  20. Using High-Performance Computing Profilers to Understand the Performance of Graph Algorithms

    … Directed Affiliations (Coda), BigClam, and Breadth First Search all achieved noticeable speedup with increasing number of cores.

    uno Repository record for Using High-Performance Computing Profilers to Understand the Performance of Graph Algorithms (opens in a new tab)

Page 1 of 6