A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths ...
IEEE

Solving Vehicle Routing Problem Using Grover Adaptive Search Algorithm

Abstract: Intelligent Transportation Systems (ITS) occupy a pivotal position in the contemporary societal landscape, with one of their widespread applications being the vehicle routing problem, ...
IEEE

CADTR: Context-Aware Trust Routing Algorithm Based on Priority Sampling DDPG for UASNs

Abstract: The underwater acoustic sensor network (UASN) is a pivotal paradigm within the underwater Internet of Things, where multi-hop forwarding-based underwater data routing is essential for ...
Frontiers

Adaptive-expert-weight-based load balance scheme for dynamic routing of MoE

School of Computer Science, Rocket Force University of Engineering, Xi'an, Shaanxi, China Load imbalance is a major performance bottleneck in training mixture-of-experts (MoE) models, as unbalanced ...