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 83 for “"depth-first-search"”.

  1. Depth-first search embedded wavelet algorithm for hardware implementation

    … to meet the diverse requirements. Recently, researchers working on improving different features have converged on a set of coding schemes commonly known as embedded wavelet algorithms. Currently, these algorithms enjoy the highest coding performances reported in the literature. In addition, …

    edithcowan Repository record for Depth-first search embedded wavelet algorithm for hardware implementation (opens in a new tab)

  2. Differential Equations and Depth First Search for Enumeration of Maps in Surfaces

    … functions which are a topic of active research. In the 1960's Walsh and Lehman introduced a method of encoding orientable maps. We develop a similar method, based on depth first search and extended to non-orientable maps. With this, we develop a bijection that extends Tutte's medial …

    waterloo Repository record for Differential Equations and Depth First Search for Enumeration of Maps in Surfaces (opens in a new tab)

  3. Comparison of Functional Dependency Extraction Methods and an Application of Depth First Search

    … from relations efficiently. KlipFind employs a depth-first, heuristic driven approach as a solution. Our study indicates that KlipFind is more space efficient than any of the existing solutions and highly efficient in finding keys for relations.

    oregon Repository record for Comparison of Functional Dependency Extraction Methods and an Application of Depth First Search (opens in a new tab)

  4. Depth first search and position based routing in ad hoc and sensor wireless networks

    … just to name a few. This thesis proposes DFS, Depth First Search, routing algorithm. It is the first position-based localized algorithm that guarantees the delivery for (connected) ad hoc wireless networks modeled by arbitrary graphs, including inaccurate location information for a destination …

    ottawa-retro Repository record for Depth first search and position based routing in ad hoc and sensor wireless networks (opens in a new tab)

  5. Intelligent Search Under Uncertain Environments

    … also use what are called the uniform heuristic search, the partial uniform heuristic search and the nonuniform heuristic search algorithms which will be described when used. These methods combine the features of the depth-first search algorithm and the simple heuristic search algorithm. All …

    sdstate Repository record for Intelligent Search Under Uncertain Environments (opens in a new tab)

  6. Dirbtinio intelekto metodų panaudojimas autonominiam besimokančiam robotui /

    … algorithms Backtrack, Backtrack1 and Depth First Search (DFS) in a maze simulation, as well as an autonomous self-learning robot. The motivation behind this study was the lack of accessible and budget-friendly projects for home and school conditions, in order for younger generations to …

    vilnius Repository record for Dirbtinio intelekto metodų panaudojimas autonominiam besimokančiam robotui / (opens in a new tab)

  7. Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma

    … and heuristic approaches to solve Nonograms. The depth first search was one of the chosen exact approaches because it is a typical example of brute search algorithm that is easy to implement. Another implemented exact approach was based on the Las Vegas algorithm, so that we intend to investigate …

    brazil-ufrn Repository record for Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma (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. Sparsity-Driven Search for Multi-Hit Genetic Mutation Combinations in Cancer

    … present an algorithmic technique, called pruned depth-first search (P-DFS), that leverages the high sparsity in tumor mutation data to prune large portions of the search space. Specifically, P-DFS - a pruning technique that exploits sparsity to drastically reduce the otherwise exponential h-hit …

    vt Repository record for Sparsity-Driven Search for Multi-Hit Genetic Mutation Combinations in Cancer (opens in a new tab)

  10. Optimal routing of battle group VERTREP assets

    … for a single helicopter. The algorithm employs a depth first search technique to solve the multiple constraint, multiple time window routing problem. Several fathoming techniques are demonstrated and computational results for eleven ship battle groups are presented.

    nps Repository record for Optimal routing of battle group VERTREP assets (opens in a new tab)

  11. Maršrutų planavimo sistema turistams /

    … the user needs. The aim of my work is to use the depth-first search algorithm to create a system of route planning which, by introducing the starting point of the trip, the planned amount of money to be spent, the available amount of time and other options, will show the available route for the …

    vilnius Repository record for Maršrutų planavimo sistema turistams / (opens in a new tab)

  12. KNN Query Processing in Wireless Sensor and Robot Networks

    … network. Several existing methods restrict the search within a predetermined boundary. Some network density-based estimation algorithms were proposed but they either result in large message transmission or require the density information of the whole network in advance which is complex to …

    ottawa-retro Repository record for KNN Query Processing in Wireless Sensor and Robot Networks (opens in a new tab)

  13. The Gordon game

    … of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis.

    eastern-wash Repository record for The Gordon game (opens in a new tab)

  14. Inducing Grammar from Sparse Data Sets

    … Current 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)

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

    … patří 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)

  16. Improving dynamic analysis with data flow analysis

    … significantly more efficient and scalable by first performing a static data flow analysis so that the dynamic analysis can be selectively applied only to important parts of the program. We apply this general principle to the design and implementation of two different systems, one for runtime …

    texas Repository record for Improving dynamic analysis with data flow analysis (opens in a new tab)

  17. RROS reliability redundancy optimization solver: A Microsoft Excel add-in

    … a hybrid technique of dynamic programming with depth first search with tighter variable bounds. The implementation takes the form of an Excel add-in, which will be familiar to users with little formal OR/MS training. The user interface design is discussed. Example applications with benchmarks …

    ottawa-retro Repository record for RROS reliability redundancy optimization solver: A Microsoft Excel add-in (opens in a new tab)

  18. Automated assembly sequence generation using a novel search scheme for handling parallel sub-assemblies

    … on the graph. The sequences are stored in a search tree and to find an optimal sequence multiple evaluation criteria like time, subassembly stability and accessibility measures are used. This research implements a novel tree search algorithm called "Ordered Depth First Search" (ODFS) to find …

    texas Repository record for Automated assembly sequence generation using a novel search scheme for handling parallel sub-assemblies (opens in a new tab)

  19. An empirical study of the influence of compiler optimizations on symbolic execution

    … program execution is a well-studied research area, and modern compilers typically offer a suite of optimization options. This thesis reports the first study (to our knowledge) on how standard compiler optimizations influence symbolic execution. We study 33 optimization flags of the LLVM …

    texas Repository record for An empirical study of the influence of compiler optimizations on symbolic execution (opens in a new tab)

  20. 3-D Coverage Path Planning for Underwater Terrain Mapping

    … is used to achieve this goal. The underwater 3-D search space is represented by a multi-level coverage tree which is generated online based on the obstacle information collected by the AUV. The nodes of the tree correspond to safe sub-areas for AUV navigation which are identified based on obstacle …

    uconn-diss Repository record for 3-D Coverage Path Planning for Underwater Terrain Mapping (opens in a new tab)

Page 1 of 5