Results 211 to 220 of about 5,083,450 (268)
Some of the next articles are maybe not open access.
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.
E. 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
Path Planning for Rolling Locomotion of Polyhedral Tensegrity Robots Based on Dijkstra Algorithm
, 2019Tensegrity-based locomotive robots have attracted more and more interests from multidisciplinary engineering community. To realize long distance locomotion for tensegrity robots in a given land, path planning is usually needed. This paper proposes a path
Yipeng Lu, Xian Xu, Yaozhi Luo
semanticscholar +1 more source
Automatic vehicle navigation using Dijkstra's Algorithm
2013 International Conference on Advances in Technology and Engineering (ICATE), 2013Packet routing algorithms such as OSPF have long been used to manage the transmission of packets over the internet. In this research paper we have explored the possibilities of using one such shortest path routing technique, Dijkstra's Algorithm, to let a car move autonomously along a mesh of interconnected roads, while choosing the least cost path ...
M. Parulekar +4 more
openaire +1 more source
Dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system
Wireless networks, 2023Jing Zhang, Jing Bai
semanticscholar +1 more source
A Clustering Routing based on Dijkstra Algorithm for WSNs
International Conference on Secure and Trust Computing, Data Management and Applications, 2019Wireless Sensor Networks (WSNs) have witnessed a growing interest in the last two decades owing to its various advantages. Thus, in a big WSN, using one hop transmission, as in LEACH algorithm, causes loss of a lot of energy. To mitigate this loss, a new
M. Abderrahim +3 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
Retroactive data structure for protein–protein interaction in lung cancer using Dijkstra algorithm
International journal of information technology, 2023Prasanna Kumar Rangarajan +4 more
semanticscholar +1 more source
International Conference on Secure and Trust Computing, Data Management and Applications, 2019
In this paper, we propose an energy-efficient multihop transmission technique for Wireless Sensor Networks (WSN) based on Dijkstra algorithm. We consider a WSN composed of N sensor nodes.
M. Abderrahim +3 more
semanticscholar +1 more source
In this paper, we propose an energy-efficient multihop transmission technique for Wireless Sensor Networks (WSN) based on Dijkstra algorithm. We consider a WSN composed of N sensor nodes.
M. Abderrahim +3 more
semanticscholar +1 more source
Dijkstra's Algorithm Model over MPLS / GMPLS
2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, 2011the 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