Results 11 to 20 of about 16,130 (172)

Efficient Network Slicing with SDN and Heuristic Algorithm for Low Latency Services in 5G/B5G Networks

Sensors, 2023
This paper presents a novel approach for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements. We propose a modified A* algorithm that incorporates network quality of service parameters into a composite ...
Robert Botez, Andres-Gabriel Pasca, Alin-Tudor Sferle, Iustin-Alexandru Ivanciu, Virgil Dobrota   +4 more
doaj   +1 more source

An Effective Algorithm for Finding Shortest Paths in Tubular Spaces

Algorithms, 2022
We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space.
Dang-Viet-Anh Nguyen, Jérôme Szewczyk, Kanty Rabenorosoa   +2 more
doaj   +1 more source

The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

International Journal of Applied Sciences and Smart Technologies, 2021
The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others.
Melki Friaswanto, Erick Alfons Lisangan, Sean Coonery Sumarta   +2 more
doaj   +1 more source

Multiple Source Replacement Path Problem

, 2020
One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge $e$ on the shortest path from $s$ to $t$.
Bernstein Aaron, Bilò Davide, Bodwin Greg, Chechik Shiri, Eppstein David, Gupta Manoj, Gupta Manoj, Michael, Parter Merav   +8 more
core   +1 more source

Automatic and semi-automatic extraction of curvilinear features from SAR images [PDF]

, 2012
Extraction of curvilinear features from synthetic aperture radar (SAR) images is important for automatic recognition of various targets, such as fences, surrounding the buildings.
Akyılmaz, Emre, Akyilmaz, Emre, Cetin, Mujdat, Nar, Fatih, Okman, O. Erman, Çetin, Müjdat   +5 more
core   +1 more source

Fast and efficient indoor navigation: a hybrid pathfinding approach using rapidly-exploring random tree (RRT)-connect and Dijkstra’s algorithm [PDF]

PeerJ Computer Science
This article introduces a hybrid approach to enhance indoor pathfinding and navigation within complex multistory environments by integrating rapidly-exploring random tree (RRT)-Connect and Dijkstra’s algorithm.
Ramamoorthy Sriramulu, Abhishek Yadav, Subha Bal Pal   +2 more
doaj   +2 more sources

Determining an optimal path for forest road construction using Dijkstra's algorithm

Journal of Forest Science, 2016
From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm.
A. Parsakhoo, M. Jajouzadeh
doaj   +1 more source

Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network [PDF]

, 2007
In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure channel model, the necessary and sufficient conditions defined in [2] for the ...
McEliece, Robert J., Soedarmadji, Edwin
core   +1 more source

Parametric shortest-path algorithms via tropical geometry

, 2021
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Joswig, Michael, Schröter, Benjamin
core   +1 more source

Shortest Paths Avoiding Forbidden Subpaths [PDF]

, 2009
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core   +6 more sources