Results 251 to 260 of about 80,592 (300)

Peek: A Prune-Centric Approach for K Shortest Path Computation

International Conference for High Performance Computing, Networking, Storage and Analysis, 2023
The K shortest path (KSP) algorithm, which finds the top $K$ shortest simple paths from a source to a target vertex, has a wide range of real-world applications, e.g., routing, vulnerability detection, and biology analysis.
Wang Feng, Shiyang Chen, Hang Liu, Yuede Ji   +3 more
semanticscholar   +1 more source

Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths

IEEE Transactions on Automatic Control, 2006
Z. Jia, P. Varaiya
openaire   +2 more sources

K-Shortest Routing For Autonomous Driving

2022 4th International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI), 2022
The future ITS-based road network can provide a seamless and integrated transportation. The network makes it more complicated for the cars to decide for an optimal choice or K-shortest paths under the autonomous driving situation.
Feng Xie, Yufei Xie, S. Lam
semanticscholar   +1 more source

Multi-Path Routing in the Jellyfish Network

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2021
The Jellyfish network has recently been proposed as an alternative to the fat-tree network for data centers and high-performance computing clusters.
Zaid Alzaid, Saptarshi Bhowmik, Xin Yuan
semanticscholar   +1 more source

Revisiting shortest path algorithms for navigation systems

SouthEast European Design Automation, Computer Engineering, Computer Networks and Social Media Conference, 2021
Efficient shortest path algorithms are central to routing and navigation applications. However, finding the shortest path is often not adequate for urban sidewalk routes, as users of these applications may also be interested in alternative routes that ...
V. Patras, I. Fudos, K. Koritsoglou, Georgios Tsoumanis   +3 more
semanticscholar   +1 more source

Finding the k Shortest Paths for Co-Evolutionary Path Optimization

IEEE Symposium Series on Computational Intelligence, 2018
Co-evolutionary path optimization (CEPO) was recently proposed to calculate optimal actual traveling trajectory in a given dynamic routing environment, and it was originally focused on the 1st shortest path.
Xiao-Bing Hu, Jun Zhou, Hang Li, Ming-Kong Zhang   +3 more
semanticscholar   +1 more source

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

Annals of Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadjiconstantinou, Eleni, Christofides, Nicos, Mingozzi, Aristide   +2 more
openaire   +1 more source

Heuristic search for one-to-many shortest path queries

Annals of Mathematics and Artificial Intelligence, 2021
Roni Stern, Meir Goldenberg, Abdallah Saffidine, Ariel Felner   +3 more
semanticscholar   +1 more source

Energy Efficient Shortest Path Routing Protocol for Wireless Sensor Networks

International Conference on Computational Intelligence and Communication Networks, 2011
K. S. Shivaprakasha, M. Kulkarni
semanticscholar   +1 more source

Intra-domain traffic engineering with shortest path routing protocols

Annals of Operations Research, 2013
A. Altin, B. Fortz, M. Thorup, Hakan Ümit   +3 more
semanticscholar   +1 more source