Results 231 to 240 of about 80,592 (300)
Deep Reinforcement Learning-Based Routing Method for Low Earth Orbit Mega-Constellation Satellite Networks with Service Function Constraints. [PDF]
Sensors (Basel)Chen Y +6 more
europepmc +1 more source
Bluetooth-Based Dynamic Nexus Mesh Communication Network for High-Density Urban Interaction Spaces. [PDF]
Sensors (Basel)Hu Y, Cheong N, Yao M, Long Q, Yu Y.
europepmc +1 more source
Two-Phase Distributed Genetic-Based Algorithm for Time-Aware Shaper Scheduling in Industrial Sensor Networks. [PDF]
Sensors (Basel)Chang RI, Hsu TW, Chen YT.
europepmc +1 more source
Optimizing carbon footprint in long-haul heavy-duty E-Truck transportation. [PDF]
Nat CommunSu J, Lin Q, Chen M.
europepmc +1 more source
A k shortest path algorithm for adaptive routing in communications networks
IEEE Transactions on Communications, 1988 The problem of finding k shortest loopless paths with distinct initial links from one node to each other node arises in several important contexts for adaptive routing in communication networks. One context is the construction or adaptive reconstruction of routing tables where a sequential routing algorithm is used, and another context is ``delta ...
Donald M. Topkis
semanticscholar +4 more sources
Improved Route Selection Strategy Based on K Shortest Path
2019 International Symposium on Networks, Computers and Communications (ISNCC), 2019 LEO satellite networks have many advantages, such as global coverage and short latency, which play a crucial role in the future global communications. Under the tide of the Internet of Things, LEO satellite networks, as an effective means of connecting remote regions, will become indispensable pillars in the integrated system of the Internet of Things.
Guanghao Huang +3 more
semanticscholar +3 more sources
2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018 k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang +6 more
semanticscholar +3 more sources
SPIE Proceedings, 2006 Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW).
Xinyou Cui +4 more
semanticscholar +3 more sources
TENCON 2014 - 2014 IEEE Region 10 Conference, 2014 For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
Eiji Mizutani
semanticscholar +3 more sources
2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023 Reinforcement learning techniques have been successfully applied to the routing and spectrum assignment problem in elastic optical networks. These techniques offer a promising approach by enabling agents to make sequential decisions based on network ...
Ivan I. Ríos-Villalba +3 more
semanticscholar +3 more sources