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

  1. 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)

  2. 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.</p>

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

  3. 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)

  4. NetSPA : a Network Security Planning Architecture

    … attack graphs using a forward-chaining depth-first search of the possible attack space using actions modeled with REM, a simple attack description language. NETSPA accepts network configuration information from a database that includes host and network software types and versions, …

    mit Repository record for NetSPA : a Network Security Planning Architecture (opens in a new tab)

  5. Constraint satisfaction - an alternate approach to unification in Prolog

    … on the form of the clauses to prune the search space. Although Prolog has been widely used for implementing natural language systems, database systems, knowledge based expert systems and other A.I tasks, it has many limitations. The inferencing is symbolic and all the computations are …

    vt Repository record for Constraint satisfaction - an alternate approach to unification in Prolog (opens in a new tab)

  6. Obstacle-Aware Wireless Video Sensor Network Deployment For 3D Indoor Space Monitoring

    … space monitoring. In this thesis, we take the first attempt to address this by modeling the general problem in a continuous space and strive to minimize the number of required video sensors to cover the given 3D regions. We then convert it into a discrete version by incorporating 3D grids for …

    mississippi Repository record for Obstacle-Aware Wireless Video Sensor Network Deployment For 3D Indoor Space Monitoring (opens in a new tab)

  7. Multi-Robot Coordination for Hazardous Environmental Monitoring

    … of robots. Our contributions are as follows. First, we address a situation where the number of hazardous agents is unknown and varies over time. We propose a search and tracking framework that can extract individual target tracks as well as estimate the number and the spatial density of …

    vt Repository record for Multi-Robot Coordination for Hazardous Environmental Monitoring (opens in a new tab)

  8. Critisearch for Scholarly Search

    Online search has empowered users with access to vast amounts of information. However, current online interfaces do not permit users to manipulate the hits on a search engine result page (SERP). This leads to the user adapting his/her own search style to suit the search engine instead of being the …

    vt Repository record for Critisearch for Scholarly Search (opens in a new tab)

  9. Building Maze Solutions with Computational Dreaming

    … that would be generated by algorithms such as depth first search and Dijkstra's algorithm. Experiments focusing on robustness performed repeated trials with identical parameters. Results demonstrated that CD is capable of achieving this result consistently, solving over 32% of mazes across 10 …

    vt Repository record for Building Maze Solutions with Computational Dreaming (opens in a new tab)

  10. Directed search for the verification of communication protocols

    … one 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 …

    freiburg-diss Repository record for Directed search for the verification of communication protocols (opens in a new tab)

  11. An analysis and implementation of linear derivation strategies

    … to trim irrelevant derivations from the search tree are the major features found In these six derivation strategies. Detecting loops and minimizing irrelevant derivations are the identified weak points of SLM. Two variations of SLM are suggested to rectify these problems. The ME …

    edithcowan Repository record for An analysis and implementation of linear derivation strategies (opens in a new tab)

  12. Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3D Indoor Monitoring

    As a result of extensive research over the past decade or so, wireless sensor networks (wsns) have evolved into a well established technology for industry, environmental and medical applications. However, traditional wsns employ such sensors as thermal or photo light resistors that are often …

    mississippi Repository record for Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3D Indoor Monitoring (opens in a new tab)

  13. Resource optimization algorithms for an automated coordinated CubeSat constellation

    … Earth-observing CubeSat constellation. The first algorithm is the Resource-Aware SmallSat Planner (RASP), which performs low-level planning of observation and communication activities for a single satellite while simultaneously keeping the satellite's onboard resources within specified …

    mit Repository record for Resource optimization algorithms for an automated coordinated CubeSat constellation (opens in a new tab)

  14. Real-time phasor measurements for improved monitoring and control of power system stability

    … The minimal PMU set is found through a dual search algorithm which uses both a modified bisecting search and a simulated annealing-based method. The former fixes the number of PMU's while the latter look for a placement set that leads to an observable network. In order to accelerate the …

    vt Repository record for Real-time phasor measurements for improved monitoring and control of power system stability (opens in a new tab)

  15. Towards Knowledge Representation of the Biowaste-to-Chemicals Domain Using Knowledge Graphs

    … lays the groundwork for addressing a critical research question: What pathways from biowaste to value-added chemical are the most sustainable, and how can we identify them? Central to answering this question is a comprehensive understanding of the data requirements within the …

    cambridge Repository record for Towards Knowledge Representation of the Biowaste-to-Chemicals Domain Using Knowledge Graphs (opens in a new tab)

  16. On-the-Fly Dynamic Dead Variable Analysis

    … only becomes worse. As such, model checking research into data abstraction as a way of mitigating state explosion has become more and more important. Data abstractions aim to reduce the effect of large input ranges. This work focuses on a static program analysis technique called dead variable …

    byu Repository record for On-the-Fly Dynamic Dead Variable Analysis (opens in a new tab)