Results 181 to 190 of about 4,817 (226)

Routing space Internet based on Dijkstra's algorithm

2009 First Asian Himalayas International Conference on Internet, 2009
Space Based Internets will be used to move earth observation data through satellite constellations to ground based receiving stations. Routing observation traffic in this environment is constrained by individual satellite orbits, individual satellite capabilities, observation schedules, ground station schedules, and rapidly evolving natural events ...
Xiang-ying Li, Guo-shun Li, Sheng-tian Zhang   +2 more
openaire   +1 more source

Dijkstra’s algorithm and L-concave function maximization

Mathematical Programming, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murota, Kazuo, Shioura, Akiyoshi
openaire   +2 more sources

Dijkstra Algorithm Based Reliability Model

2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications, 2012
The 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, Gustavo Lopez Rubio, Lilia Castellanos   +2 more
openaire   +1 more source

Neural Implementation of Dijkstra’s Algorithm.

2003
This 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, J. Muñoz-Pérez, R. Benítez-Rochel   +2 more
openaire   +1 more source

The improved Dijkstra's shortest path algorithm

2011 Seventh International Conference on Natural Computation, 2011
The 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

Automatic vehicle navigation using Dijkstra's Algorithm

2013 International Conference on Advances in Technology and Engineering (ICATE), 2013
Packet 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, V. Padte, T. Shah, K. Shroff, R. Shetty   +4 more
openaire   +1 more source

A Note on Dijkstra's Shortest Path Algorithm

Journal of the ACM, 1973
An 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 Model over MPLS / GMPLS

2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, 2011
the 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, Cristyan Manta, Gustavo Lopez Rubio   +2 more
openaire   +1 more source

A parallelization of Dijkstra's shortest path algorithm

1998
The 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., Mehlhorn, K., Meyer, U., Sanders, P.   +3 more
openaire   +2 more sources

Dijkstra’s Algorithm – The Closest Look

2015
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it.
openaire   +1 more source