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 6 of 6 for “"route algorithm"”.

  1. Optimal stochastic paths

    <p>A shortest-route algorithm for finite networks is modified for application to path-dependent finite networks and to stochastic networks. The type of stochastic network considered has a "capture" probability associated with each node;The problem of finding a path of minimum expected value on a …

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

  2. Real-time crash risk modelling and its applications in intelligent transportation systems

    … indices. The second extends this methodology to route planning, presenting a real-time safest route algorithm that quantifies and minimizes exposure to high-risk conditions, while examining trade-offs between safety and mobility. The third application demonstrates the use of autonomous vehicle …

    ubc Repository record for Real-time crash risk modelling and its applications in intelligent transportation systems (opens in a new tab) Download PDF for Real-time crash risk modelling and its applications in intelligent transportation systems (opens in a new tab)

  3. The shortest path to cardiac activation.

    … describes the application of the shortest path algorithm in the simulation of cardiac activation. This method is both used in the forward simulation of an electrocardiogram (ECG) as well as in the non-invasive imaging of cardiac activation and recovery. Due to the immense number of cardiac cells …

    radboud Repository record for The shortest path to cardiac activation. (opens in a new tab) Download PDF for The shortest path to cardiac activation. (opens in a new tab)

  4. Data routing in multicore processors using dimension increment method

    A Deadlock-free routing algorithm can be generated for arbitrary interconnection network using the concept of virtual channels but the virtual channels will lead to more complex algorithms and more demands of NOC resource. In this thesis, we study a Torus topology for NOC application, design its …

    unlv Repository record for Data routing in multicore processors using dimension increment method (opens in a new tab) Download PDF for Data routing in multicore processors using dimension increment method (opens in a new tab)

  5. Modelagem de corredores para Callicebus Coimbrai e Callicebus Barbarabrownae, primatas ameaçados no Nordeste brasileiro

    … had as objective to identify possible connection routes, simulating corridors among forest remnants occupied by both species within priority areas. We developed a bibliographic survey (2000-2016) in thesis, dissertations and internet bases to obtain the species’ occurrence points. To simulate …

    brazil-ufrn Repository record for Modelagem de corredores para Callicebus Coimbrai e Callicebus Barbarabrownae, primatas ameaçados no Nordeste brasileiro (opens in a new tab)

  6. Path Prediction and Path Diversion Identifying Methodologies for Hazardous Materials Transported by Malicious Entities

    … a satisfactory performance .The path prediction algorithm was used to calculate the paths to two targets located at the International Dulles Airport and the National Mall in Washington, DC. Based on this research, the neural network methodology is a promising technology for detecting a hijacked …

    vt Repository record for Path Prediction and Path Diversion Identifying Methodologies for Hazardous Materials Transported by Malicious Entities (opens in a new tab)