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 3065 for “"Paths"”.

  1. On labeled paths

    … investigation of their intersection, the labeled paths. This dissertation examines three results in the area of labeled path problems. The first result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The …

    alabama Repository record for On labeled paths (opens in a new tab)

  2. Paths and categories

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1983.

    mit Repository record for Paths and categories (opens in a new tab)

  3. Three paths to Zion

    This thesis project pursues the strategies to create urban design interventions that preserve and encourage multi-religious harmony in the contested sacred topography of Jerusalem. First, I observed the environmental and social qualities of religious coexistence by studying a pilgrimage site in …

    mit Repository record for Three paths to Zion (opens in a new tab)

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

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

  6. Focus+Context via Snaking Paths

    … depicting cylindrical structures along snaking paths that enables the structures themselves to become the transitions and focal areas, simultaneously. A method to automatically create a snaking path through space by applying a path finding algorithm is presented. A 3D curve is created based on …

    calgary Repository record for Focus+Context via Snaking Paths (opens in a new tab)

  7. Stress paths and collapsing soils

    The design of footings and the accurate prediction of settlements is inherently difficult as the parameters involved vary considerably. The initial stage of the design consists of three steps. The first step is to define all the parameters required. The second step is to give quantitive values to …

    cape-town Repository record for Stress paths and collapsing soils (opens in a new tab)

  8. Survivable paths in multilayer networks

    … In single-layer net- works, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where disjoint paths may not always exist. In this thesis, we take a new approach which is based on finding …

    mit Repository record for Survivable paths in multilayer networks (opens in a new tab)

  9. Optimal Paths in Gliding Flight

    … approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the …

    vt Repository record for Optimal Paths in Gliding Flight (opens in a new tab)

  10. Exogenous Influences and Paths To Activism

    The focus of this research was to ascertain the indirect effects upon activism of intervening variables and recognized exogenous influences upon activism. In addition, this research also focused upon the differences and similarities of a recruited activist model and spontaneous activist model. …

    unt Repository record for Exogenous Influences and Paths To Activism (opens in a new tab)

  11. Angle constrained paths in sensor networks

    Short-length paths in geometric graphs are not necessarily feasible in sensor networks and robotics. Paths with sharp-turn angles cannot be used by robotic vehicles and tend to consume more energy in sensor networks; In this thesis, we investigate the development of short-length paths without …

    unlv Repository record for Angle constrained paths in sensor networks (opens in a new tab)

  12. Upset Paths and 2-Majority Tournaments

    <p>In 2005, Alon, et al. proved that tournaments arising from majority voting scenarios have minimum dominating sets that are bounded by a constant that depends only on the notion of what is meant by a majority. Moreover, they proved that when a majority means that Candidate A beats Candidate B …

    csusb Repository record for Upset Paths and 2-Majority Tournaments (opens in a new tab)

  13. Radio Number for Fourth Power Paths

    <p>A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted …

    csusb Repository record for Radio Number for Fourth Power Paths (opens in a new tab)

  14. Leverages firms used in growing paths

    … to strategic leverages or related to growth paths of firms. In chapter 3, a basic mechanism of leverages in business was analyzed by introducing the Leverage Driver Model. In chapter 4, the scope of the LDM was expanded to applying itself to leveraging between products and between firms. …

    mit Repository record for Leverages firms used in growing paths (opens in a new tab)

  15. Approximation algorithms for disjoint paths problems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for Approximation algorithms for disjoint paths problems (opens in a new tab)

  16. Reducing Curvature in Complex Tool Paths by Deviating from CAM-Produced Tool Paths Within a Tolerance Band

    … to decrease high-curvature sections in tool paths for complex parts to achieve shorter machining times resulting in higher production rates. In the research sample cases, the algorithm decreased machining times by 1% to 9% for design-induced sections of high curvature and by 16% to 75% for …

    byu Repository record for Reducing Curvature in Complex Tool Paths by Deviating from CAM-Produced Tool Paths Within a Tolerance Band (opens in a new tab)

  17. Optimal Paths Related to Discrete Transport Problems

    lethbridge

  18. Planning Practical Paths in High-Dimensional Space

    … process for high DOF robots. The practicality of paths are formulated based on the notion of soft constraints found in the Planning Domain Definition Language 3 (PDDL3). A range of optimization strategies are developed targeted towards user-preferred qualities by integrating soft constraints in …

    york Repository record for Planning Practical Paths in High-Dimensional Space (opens in a new tab)

  19. Printing Conductive Paths for Electronic Functional Devices

    Printing inorganic and organic materials has been attracting plenty of researchers and scientists as an alternative to the conventional photolithography and electroless deposition methods due to the complications, time-consuming, size restrictions and high costs that these methods usually …

    de-montfort Repository record for Printing Conductive Paths for Electronic Functional Devices (opens in a new tab)

  20. Circuits, Perfect Matchings and Paths in Graphs

    … the edge spectrum of saturation number for small paths, where the spectrum was consisted of all possible integers between saturation number and Turan number.

    wvu Repository record for Circuits, Perfect Matchings and Paths in Graphs (opens in a new tab)

Page 1 of 154