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 96 for “"Least Cost Path"”.

  1. Least Cost Path Modeling Between Inka and Amazon Civilizations

    Least Cost Path Analysis (LCPA) is a GIS-based approach for calculating the most efficient route between a start and end point, often in terms of shortest time or least amount of energy. The approach is often applied in archaeology to estimate locations of sites, and routes between them. We applied …

    vt Repository record for Least Cost Path Modeling Between Inka and Amazon Civilizations (opens in a new tab)

  2. Solving the weighted region least cost path problem using transputers.

    The weighted region least cost path problem involves finding the minimal cost path between a source point and a goal point through a plane that has been subdivided into weighted regions. In this thesis, we investigate a new parallel approach which seeks to take advantage of the distributed, …

    nps Repository record for Solving the weighted region least cost path problem using transputers. (opens in a new tab)

  3. SYSTEMATIC COMPARISON OF TWO HABITAT CONNECTIVITY MODELING APPROACHES: LEAST COST PATH AND CIRCUIT THEORY

    … on comparing two prevalent approacheds, 1) least cost path, patch-patch modeling using CorridorDesigner software and 2) electrical circuit-theory based approaches for patch-patch and 'all points' connectivity using Circuitscape software. Additionally, I compared two dominant connectivity …

    clemson Repository record for SYSTEMATIC COMPARISON OF TWO HABITAT CONNECTIVITY MODELING APPROACHES: LEAST COST PATH AND CIRCUIT THEORY (opens in a new tab)

  4. Efficient grid based techniques for solving the weighted region least cost path problem on multicomputers

    … parallel algorithms to solve the Weighted Region Least Cost Path problem. Two complimentary steps have been undertaken. First, an efficient sequential algorithm to solve the above problem was developed. the algorithm is a modification of a Gauss-Seidel-like algorithm for obtaining the minimum …

    nps Repository record for Efficient grid based techniques for solving the weighted region least cost path problem on multicomputers (opens in a new tab)

  5. PRIORITIZING PARCELS FOR CONSERVATION EASEMENTS USING LEAST-COST PATH ANALYSES OF LAND OWNERSHIP: CASE STUDY WITHIN THEORIZED GRIZZLY BEAR MIGRATION CORRIDORS OF WESTERN MONTANA

    … easements on private parcels. It utilizes least cost pathway analyses within theorized grizzly bear migration corridors of western Montana to show the potential for conservation easements to provide connectivity of protected lands within conservation corridors. The case study compares …

    montana Repository record for PRIORITIZING PARCELS FOR CONSERVATION EASEMENTS USING LEAST-COST PATH ANALYSES OF LAND OWNERSHIP: CASE STUDY WITHIN THEORIZED GRIZZLY BEAR MIGRATION CORRIDORS OF WESTERN MONTANA (opens in a new tab)

  6. PRIORITIZING PARCELS FOR CONSERVATION EASEMENTS USING LEAST-COST PATH ANALYSES OF LAND OWNERSHIP: CASE STUDY WITHIN THEORIZED GRIZZLY BEAR MIGRATION CORRIDORS OF WESTERN MONTANA

    … easements on private parcels. It utilizes least cost pathway analyses within theorized grizzly bear migration corridors of western Montana to show the potential for conservation easements to provide connectivity of protected lands within conservation corridors. The case study compares …

    montana-tech Repository record for PRIORITIZING PARCELS FOR CONSERVATION EASEMENTS USING LEAST-COST PATH ANALYSES OF LAND OWNERSHIP: CASE STUDY WITHIN THEORIZED GRIZZLY BEAR MIGRATION CORRIDORS OF WESTERN MONTANA (opens in a new tab)

  7. A Geographic Information System Approach to Determine Connectivity between Duck Mountain Provincial Park and Forest and Riding Mountain National Park, Manitoba

    … to Duck Mountain Provincial Park and Forest. Least-cost path modelling showed that presently there is no corridor of continuous forest or corridor of undeveloped land between these two areas, of which developed land appears to fragment all possible paths. Maps generated from spatial graphs and …

    manitoba Repository record for A Geographic Information System Approach to Determine Connectivity between Duck Mountain Provincial Park and Forest and Riding Mountain National Park, Manitoba (opens in a new tab)

  8. GIS based optimal design of sewer networks and pump stations

    … downstream subwatersheds via a force main. The path and destination of each force main in the system is determined by applying the Dijkstra's shortest path algorithm to select the least cost path from a set of potential paths. This method seeks to minimize the total dynamic head. A modified …

    vt Repository record for GIS based optimal design of sewer networks and pump stations (opens in a new tab)

  9. Assessing the Effect of Reservoirs on Gene Flow in the Southern Two-Lined Salamander (Eurycea Cirrigera)

    … and resistant landscape models to determine the least-cost path of gene flow between subpopulations. This analysis showed population structure corresponded heavily with sample sites at both locations, though differentiation of populations was not the result of isolation-by distance at the Barren …

    wku-diss Repository record for Assessing the Effect of Reservoirs on Gene Flow in the Southern Two-Lined Salamander (Eurycea Cirrigera) (opens in a new tab)

  10. Community and Sanctuary within the Chora of Metaponto

    … within a project Geographic Information System, Least Cost Path (LCP) is used to reconstruct ancient routes between rural farmsteads and sanctuaries. LCPs are a means of presenting lines drawn over digitized terrain in order to reconstruct the easiest route of travel between two points with …

    mcmaster Repository record for Community and Sanctuary within the Chora of Metaponto (opens in a new tab)

  11. Commercial Bank Profits: An Analysis of Variances in Bank Earnings from The Various Sources of Funds

    … is in effect the managing of liabilities by the least cost path and that government regulations do have a nullifying effect on run away profit

    nodak Repository record for Commercial Bank Profits: An Analysis of Variances in Bank Earnings from The Various Sources of Funds (opens in a new tab)

  12. GIS and Archaeology: Bison Hunting Strategies in Southern Saskatchewan

    … into the research design in the form of Least Cost Path and Viewshed analyses. Both archaeological data from Walker's survey and environmental data such as elevation and water sources served as the input datasets required by ArcGIS's spatial analysis tools. The results of the Least Cost …

    sask Repository record for GIS and Archaeology: Bison Hunting Strategies in Southern Saskatchewan (opens in a new tab)

  13. Geographic Information System Analyses of Precontact Stone Features at the Forks of the South Saskatchewan and Red Deer Rivers

    … through spatial plotting, viewshed analysis, least cost path analysis, and spatial autocorrelation of the 1,203 stone feature points identified by Drs. Reeves and Kennedy. It was hypothesized that the most prominent stone feature of the area, the Bull’s Forehead Medicine Wheel (aka Roy Rivers …

    sask Repository record for Geographic Information System Analyses of Precontact Stone Features at the Forks of the South Saskatchewan and Red Deer Rivers (opens in a new tab)

  14. Custom-Quality Wire Routing Using Modern Design Rules

    … spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route …

    cornell Repository record for Custom-Quality Wire Routing Using Modern Design Rules (opens in a new tab)

  15. Traversing the Terrain: A Least Cost Analysis on Intersite Causeways in the Maya Region

    … These causeway systems were evaluated using least-cost paths based on the terrain. In this thesis, I argue that the intersite causeways do not follow a least-cost path based on terrain and that the purpose of these roads varies between sites and regions.

    ucf Repository record for Traversing the Terrain: A Least Cost Analysis on Intersite Causeways in the Maya Region (opens in a new tab)

  16. Process- Versus Pattern-Based Measures of Fragmentation: A Simulated Sensitivity Analysis

    … an alternative process-based approach using the cost of traversing a landscape as a proxy for fragmentation and compare it with the traditional approach. One thousand binary landscapes varying in composition and configuration were simulated, and least-cost path analysis provided the data to …

    york Repository record for Process- Versus Pattern-Based Measures of Fragmentation: A Simulated Sensitivity Analysis (opens in a new tab)

  17. Comparing methods for assessing habitat connectivity: a case study of guinas (Leopardus guigna) in a fragmented Chilean landscape

    … or impede connections among patches of habitat. Least-cost path (LCP) and circuit theory (CT) are two methods commonly used to evaluate landscape-level connectivity among patches. Both methods use resistance surfaces that can be generated from Resource Selection Functions (RSF) or the Analytical …

    umn Repository record for Comparing methods for assessing habitat connectivity: a case study of guinas (Leopardus guigna) in a fragmented Chilean landscape (opens in a new tab)

  18. Creating Tallgrass Prairie Corridors for Species at Risk Using Geographic Information Systems in Norfolk County, ON

    … in the study. The habitat index map forms the cost surface used to perform a least-cost path analysis which illustrates the optimal corridor connecting core areas. Ideal lands for acquisition for corridor development are low cost, distant from urban built up areas, existing in natural …

    york Repository record for Creating Tallgrass Prairie Corridors for Species at Risk Using Geographic Information Systems in Norfolk County, ON (opens in a new tab)

Page 1 of 5