Results 201 to 210 of about 5,425,704 (264)
Some of the next articles are maybe not open access.
Tsunami Simulation Based on Dijkstra Algorithm
2014 17th International Conference on Network-Based Information Systems, 2014This paper is concerned with the proposal of a numerical method to predict the movement of tsunami wave front by use of Dijkstra algorithm. Data for sea depth and land height are assigned to the nodes of rectangular meshes and the data values at the points except for these node points are approximated by linear interpolation.
Kazunori Uchida +3 more
openaire +1 more source
A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path
International Congress on Information and Communication Technology, 2019Path optimization is especially useful for improving freight efficiency, and the problem of finding the maximum load path is an important issue in path optimization.
Kaicong Wei +3 more
semanticscholar +1 more source
On Dijkstra’s Algorithm for Deadlock Detection
2009We study a classical problem in operating systems concerning deadlock detection for systems with reusable resources. The elegant Dijkstra’s algorithm utilizes simple data structures, but it has the cost of quadratic dependence on the number of the processes.
Youming Li +2 more
openaire +1 more source
Proceedings of the International Symposium on Combinatorial Search, 2021
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
An Improved Dijkstra's Algorithm for Shortest Path Planning on 2D Grid Maps
IEEE International Conference on Electronics Information and Emergency Communication, 2019Finding a shortest path from an arbitrarily selected initial position to a single goal position is very useful in some domains, such as in partially-known environments or control many robotics from different initial positions to move to the goal position.
Li Wenzheng, Liu Junjun, Yao Shunli
semanticscholar +1 more source
Neural Implementation of Dijkstra’s Algorithm.
2003This paper presents an extension of the Self Organizing Map model called Associative SOM that is able to process different types of input data in separated data-paths. The ASOM model can easily deal with situations of incomplete data-patterns and incorporate class labels for supervisory purposes.
Enrique Mérida Casermeiro +2 more
openaire +1 more source
Two Block Partitioned Dijkstra Algorithms
2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to ...
Xinyu Mao, Yuxin Cheng, Haige Xiang
openaire +1 more source
, 2019
Currently, traverse/mission planning for deployed rovers (e.g., on Mars) requires planetary scientists to spend many hours on laborious surface terrain analysis in order to minimize some traverse aspects (e.g., distance) while maximizing others (e.g ...
W. Fink +5 more
semanticscholar +1 more source
Currently, traverse/mission planning for deployed rovers (e.g., on Mars) requires planetary scientists to spend many hours on laborious surface terrain analysis in order to minimize some traverse aspects (e.g., distance) while maximizing others (e.g ...
W. Fink +5 more
semanticscholar +1 more source
A Note on Dijkstra's Shortest Path Algorithm
Journal of the ACM, 1973An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O ( n 3 ) steps is disproved by showing a set of networks which take O ( n 2 n
openaire +2 more sources
Dijkstra’s algorithm and L-concave function maximization
Mathematical Programming, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazuo Murota, Akiyoshi Shioura
openaire +2 more sources