Results 81 to 90 of about 5,083,450 (268)
Optimal Transport and Seismic Rays
Mathematics, 2023 We present a theoretical framework that links Fermat’s principle of least time to optimal transport theory via a cost function that enforces local transport.
Fabrizio Magrini, Malcolm Sambridge
doaj +1 more source
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms [PDF]
, 2016 Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra\u27s single source shortest path algorithm, resort to cumbersome and ...
Morrison, Adam +2 more
core +1 more source
Dynamic Scope-Based Dijkstra's Algorithm
, 2012 We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We first motivate dynamization of the concept of scope admissibility, and then we briefly describe a modification of the scope-aware query algorithm of HM2011A to dynamic road ...
Hlineny, Petr, Moris, Ondrej
openaire +2 more sources
Impacts of Biostimulants on Nitrous Oxide Emissions and the Soil Microbiome
Journal of Plant Nutrition and Soil Science, EarlyView.Soil incubation experiment examining the influence of biostimulants on greenhouse gas emissions and the soil microbiome in fertilized soils. ABSTRACT Background Overapplication of nitrogenous fertilizer and enhanced microbial activity in agricultural soils are drivers of increasing greenhouse gas emissions.
Conor Blunt +4 more
wiley +1 more source
Dynamic route planning for emergency escape in coal mines using a Dijkstra-ACO hybrid algorithm
Gong-kuang zidonghuaEmergency escape route planning in coal mines must adapt promptly to the changing underground environment. Traditional methods, relying on static networks with fixed weights, lack the flexibility needed for real-time adjustments in response to dynamic ...
LU Guoju, SHI Wenfang
doaj +1 more source
Performance Evaluation of using a Dynamic Shortest Path Algorithm in OLSRv2 [PDF]
, 2010 MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices.
Herberg, Ulrich
core +1 more source
Single Source - All Sinks Max Flows in Planar Digraphs [PDF]
, 2012 Let G = (V,E) be a planar n-vertex digraph. Consider the problem of computing max st-flow values in G from a fixed source s to all sinks t in V\{s}. We show how to solve this problem in near-linear O(n log^3 n) time.
Nussbaum, Yahav +3 more
core +1 more source
AIS Based Shipping Routes Using the Dijkstra Algorithm
TransNav: International Journal on Marine Navigation and Safety of Sea Transportation, 2019 This paper proposes an approach for identifying and characterizing shipping routes using information contained in Automatic Identification System messages broadcasted by ships and recorded by the coastal Vessel Traffic Service centre.
P. Silveira, Â. Teixeira, Carlos Soares
semanticscholar +1 more source
An Exact Method for Reliable Shortest Path Problems With Correlation
Networks, EarlyView.ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
International Journal of Advanced Robotic Systems, 2020 Safe lane changing of the dynamic industrial park and port scenarios with autonomous trucks involves the problem of planning an effective and smooth trajectory.
Feng Zhang, Ranfei Xia, Xinxing Chen
doaj +1 more source