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 137 for “"breadth-first"”.
-
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 …
-
Theory and techniques for synthesizing efficient breadth-first search algorithms
… 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 create efficient algorithms that are correct by construction, obviating the need for a …
-
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
-
Persistent search: a bridge between depth-first and breadth-first search for physical agents.
… to span the continuum of behaviors between depth-first and breadth-first search.
-
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 …
-
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 …
-
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 …
-
On End Vertices of Search Algorithms
… restricted bipartite graphs for Lexicographic Breadth First Search, but solvable in polynomial time on split graphs for Breadth First Search. We show that the end-vertex problem is tractable for Lexicographic Breadth First Search on proper interval bigraphs and for Lexicographic Depth First …
-
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 …
-
Path exploration during code navigation
… in a number of fields suggests that a more breadth-first approach to problem solving should be more successful than a more depth-first approach. Unfortunately, modern Integrated Development Environments (IDEs) do not sup port a breadth-first search well because they do not help developers …
-
Data Structures for Fast Access Control in ECM Systems
… each subject). Additionally, we notice that with breadth-first ID numbering we may encounter many contiguous IDs under one object (e.g., folder) . To optimize the efficiency taking into account the above two characteristics, this thesis presents a space-efficient data structure specifically …
-
UNIPARSE: a universal parser
… a Universal Turing Machine and utilizes bounded Breadth-First search and development techniques to evaluate Type O languages.
-
Parallel algorithm for solving integer linear programs
… ILPs. We discuss a serial algorithm using a breadth-first branch-and-bound search to check the feasible solution space, and then extend it into a parallel algorithm using a client-server model. In the parallel mode, the search may not be truly breadth-first, depending on the solution time for …
-
Demonstrační program simulace zásobníkových automatů
… umělé inteligence - prohledávání do šířky - Breadth First Search.
-
Parallelization of formal concept analysis algorithms
… test failures and using a combined depth first and breadth first search. The algorithms were implemented in an un-optimized way to focus on the comparison on the algorithms themselves and not on any efficiencies provided by optimizing code. One of the findings were that there is a …
-
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 …
-
Efficient Parallel Algorithms and Data Structures Related to Trees
… three cost-optimal parallel algorithms for breadth-first traversal of general trees, sorting a special class of integers, and coloring an interval graph with the minimum number of colors.
-
Scheduling Irregular Workloads on GPUs
… for irregular workloads. When used in a Breadth First Search (BFS) algorithm, the proposed simple, monolithic concurrent queue scales to within 10% of ideal scalability on AMD’s Fiji GPU with 14,336 active threads. The dissertation presents an important finding that the retry overhead …
-
Directed search for the verification of communication protocols
… applies reachability algorithms like <br>depth-first, and breadth-first search for this purpose. Breadth-first <br>search is, in general, not memory-efficient, but offers shortest <br>counterexamples. On the other hand, depth-first search is more <br>memory-efficient, but delivers suboptimal …
-
Gromit An In-Memory Graph Database
… linked list manner in main memory. We implement breadth-first traversal and depth-first traversal to retrieve data for queries. This database supports concurrency and implements locking mechanisms for transaction management. We deploy two benchmark suites from social network domain to evaluate …
Page 1 of 7