Results 211 to 220 of about 28,895 (272)
2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018 Yang Wang +6 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Multi-Path Routing in the Jellyfish Network
IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2021The 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, 2021Efficient 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 +3 more
semanticscholar +1 more source
An Efficient K-Shortest Paths Based Routing Algorithm
, 2012 Jian Lian, Yan Zhang, Cheng Jiang Li
openalex +2 more sources
Finding the k Shortest Paths for Co-Evolutionary Path Optimization
IEEE Symposium Series on Computational Intelligence, 2018Co-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 +3 more
semanticscholar +1 more source
Link Prediction Using Top-k Shortest Distances
British International Conference on Databases, 2017Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network.
A. Lebedev +3 more
semanticscholar +1 more source
k-Optimized Path Routing for High-Throughput Data Center Networks
International Symposium on Computing and Networking - Across Practical Development and Theoretical Research, 2018Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been reported that randomly-connected inter-switch networks can enlarge the network throughput. For irregular networks, a multi-path
Ryuta Kawano +3 more
semanticscholar +1 more source
Heuristic search for one-to-many shortest path queries
Annals of Mathematics and Artificial Intelligence, 2021Roni Stern +3 more
semanticscholar +1 more source