Results 141 to 150 of about 3,683 (185)
Some of the next articles are maybe not open access.
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
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
The improved Dijkstra's shortest path algorithm
2011 Seventh International Conference on Natural Computation, 2011The shortest path problem exists in variety of areas. A well known shortest path algorithm is Dijkstra's, also called “label algorithm”. Experiment results have shown that the “label algorithm” has the following issues: ①. Its exiting mechanism is effective to undigraph but ineffective to digraph, or even gets into an infinite loop; ②.
Shu-Xi Wang, Xing-qiu Zhao
openaire +1 more source
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
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
A parallelization of Dijkstra's shortest path algorithm
1998The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel.
Crauser, A. +3 more
openaire +2 more sources
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
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 Algorithm Based Reliability Model
2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications, 2012The increased use of virtual connections in packet switched networks, in particular over the Internet, using MPLS and GMPLS evolution has produced a significant amount of studies on traffic engineering protocols, especially with regard to the different ways to provide quality of service over connections.
Octavio J. Salcedo Parra +2 more
openaire +1 more source
Understanding Dijkstra Algorithm
SSRN Electronic Journal, 2013Dijkstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths ...
openaire +1 more source