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 12331 for “"paths"”.

  1. Urban Paths

    The typology for this thesis project will be a hybrid transit center. Public awareness on the effects that vehicles and buildings have on the environment is a large component to this project. This will be done through a design that utilizes regenerative ideas as well as exploring the importance of …

    ndsu Repository record for Urban Paths (opens in a new tab)

  2. Lattice Paths

    … Chapter 1 looks into the history of lattice paths. That is, when it began and how it was popularized. Chapter 3 focuses on general lattices and lattice paths. It later looks into different types of properties of some lattice paths. This is divided into two types: quarter-plane and …

    waterloo Repository record for Lattice Paths (opens in a new tab)

  3. Optimal stochastic paths

    … Conditions are presented under which countable paths have the same minimum expected value as permutation paths;A continuous analog of the countable network, consisting of a hazard function on the plane and curves in the plane, is developed. Two optimality criteria are investigated: stochastic …

    iastate Repository record for Optimal stochastic paths (opens in a new tab)

  4. Detours admitting short paths

    Finding shortest paths between two vertices in a weighted graph is a well explored problem and several efficient algorithms for solving it have been reported. We propose a new variation of this problem which we call the Detour Admitting Shortest Path Problem (DASPP).We present an efficient …

    unlv Repository record for Detours admitting short paths (opens in a new tab) Download PDF for Detours admitting short paths (opens in a new tab)

  5. Quantum Paths to Cryptanalysis

    Quantum computers offer a novel approach to data processing, which poses both opportunities and threats for modern cryptography. While Shor’s algorithm for prime factorisation demonstrated the possible impact of quantum cryptanalysis, the complete quantum significance in the cryptanalytical context …

    fu-berlin Repository record for Quantum Paths to Cryptanalysis (opens in a new tab)

  6. Escort: Securing scout paths

    It is becoming increasingly common to find special-purpose communication devices--Information Appliances--attached to the Internet. Information appliances include network-attached disks, cameras, and displays; web and file servers; set-top boxes; application routers and firewalls. Many of these …

    arizona-thes Repository record for Escort: Securing scout paths (opens in a new tab)

  7. Shortest paths in line arrangements

    The problem of finding a shortest Euclidean path in an arrangement of lines between two points in the arrangement has been extensively studied; however, the best known exact solution takes quadratic time, and it’s not known if a subquadratic time algorithm exists. While I did not succeed in …

    ubc Repository record for Shortest paths in line arrangements (opens in a new tab) Download PDF for Shortest paths in line arrangements (opens in a new tab)

  8. Computing Paths in Massive Graphs

    Graph is a widely used data structure for representing real-world entities and their relationships. Graph queries play an important role in the processing of graphs, and path queries are one of the most important types of query operations on graphs. A path query attempts to retrieve the path from …

    uts Repository record for Computing Paths in Massive Graphs (opens in a new tab)

  9. High Clearance Collision-Free Paths

    … can be processed to construct high clearance paths. Neighbors of free-region nodes are carefully joined to obtain a connected graph outside the obstacles. Standard graph searching algorithms are applied in the constructed connected graph to obtain high-clearance paths. We also present methods …

    unlv Repository record for High Clearance Collision-Free Paths (opens in a new tab) Download PDF for High Clearance Collision-Free Paths (opens in a new tab)

  10. Reachability and Turn Constraint Paths

    … algorithms for constructing collision-free paths have been explored extensively. We review existing algorithms for constructing collision-free paths under turn-angle constraints. We examine the problem of computing collision-free paths in the presence of polygonal obstacles. We present an …

    unlv Repository record for Reachability and Turn Constraint Paths (opens in a new tab) Download PDF for Reachability and Turn Constraint Paths (opens in a new tab)

  11. Disjoint paths in geometric graphs

    Construction of the shortest paths connecting two given nodes in a geometric graph is the quintessential problem in computational geometry. We consider several variations of this problem with applications that include robotics, Geographic Information Systems, and sensor networks. The first problem …

    unlv Repository record for Disjoint paths in geometric graphs (opens in a new tab) Download PDF for Disjoint paths in geometric graphs (opens in a new tab)

  12. Lipschitz geometry and rough paths

    … observations on the local properties of rough paths and Lipschitz maps to give a rather flexible structure on manifolds that allow the definition of rough paths on them and explain how the same process can be used to define a notion of coloured paths on manifolds, assuming that one can build a …

    oxford Repository record for Lipschitz geometry and rough paths (opens in a new tab)

  13. Career Paths to Navy Admiral

    … is to trace the most common professional career paths followed by male and female flag officers in the U.S. Navy and to examine how certain aspects of a military career might have influenced selection to the ranks of flag officer. In addition, this study explored: (1) how female flag officers …

    usd-thes Repository record for Career Paths to Navy Admiral (opens in a new tab)

  14. Collaborative Authoring of Walden's Paths

    … collaborative authoring prototype of Walden's Paths targets two groups of users: educators and learners. From the perspective of educators, the authoring tool allows educators to collaboratively build a Walden's Path by filtering and organizing web pages into an ordered linear structure for the …

    tamu Repository record for Collaborative Authoring of Walden's Paths (opens in a new tab)

Page 1 of 617