Results 21 to 30 of about 4,841 (225)
Hybrid Bellman–Ford–Dijkstra algorithm
Journal of Discrete Algorithms, 2017 The paper considers the single-source shortest paths problem in a digraph with negative edge costs allowed. A new, hybrid algorithm for finding shortest paths from a source \(s\) in a graph \(G\) with general edge costs is constructed by combining Bellman-Ford and Dijkstra algorithms (hence BFD algorithm).
Dinitz, Yefim, Itzhak, Rotem
openaire +2 more sources
On the Optimization of Dijkstra’s Algorithm [PDF]
, 2011 In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm.
Kadry, Seifedine +2 more
openaire +2 more sources
A Dijkstra-Type Algorithm for Dynamic Games [PDF]
Dynamic Games and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARDI, MARTINO, J. P. Maldonado Lopez
openaire +3 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
Fast and efficient indoor navigation: a hybrid pathfinding approach using rapidly-exploring random tree (RRT)-connect and Dijkstra’s algorithm [PDF]
PeerJ Computer ScienceThis 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 +2 more
doaj +2 more sources
On the utility of network coding in dynamic environments [PDF]
, 2004 Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient decentralized operation of ...
Chang, Yu-Han +5 more
core +2 more sources
HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments
ISPRS International Journal of Geo-Information, 2013 Low-cost robots are characterized by low computational resources and limited energy supply. Path planning algorithms aim to find the optimal path between two points so the robot consumes as little energy as possible.
Javier Garrido +5 more
doaj +1 more source
Historical Relative Performance Index over Interconnectedness of Badminton Athletes [PDF]
, 2007 The paper proposes the Historical Relative Performance Index in order to quantitatively extract information in the scores hit in the sets of head-to-head game in badminton tournaments.
Khanafiah, Deni +2 more
core +1 more source
Public transport route planning: Modified dijkstra's algorithm
2017 International Conference on Computer Science and Engineering (UBMK), 2017 Public transport applications, which aim to propose the ideal route to end users, have commonly been used by passengers. However, the ideal route for public transport varies depending on the preferences of users. The shortest path is preferred by most users as a primary criterion for the ideal route.
Bozyigit, Alican +2 more
openaire +3 more sources
Calculating the Shortest Path Using Dijkstra’s Algorithm
Araştırma Temelli Etkinlik Dergisi, 2018 The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean ...
Bekir Cevizci
doaj +4 more sources