Abstract: This paper presents and proves the correctness of a modified Dijkstra's algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of ...
Abstract: Communication networks are difficult to model and predict because they have become very sophisticated and dynamic. We develop a reinforcement learning routing algorithm (RLRouting) to solve ...
Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results