Hard-Real-Time Routing in Probabilistic Graphs to Minimize Expected Delay (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Hard-Real-Time Routing in Probabilistic Graphs to Minimize Expected Delay

Award ID(s):: 1948457 1850851

NSF-PAR ID:: 10248681

Author(s) / Creator(s):: Agrawal, Kunal; Baruah, Sanjoy; Guo, Zhishan; Li, Jing; Vaidhun, Sudharsan

Date Published:: 2020-12-01

Journal Name:: RTSS

Page Range / eLocation ID:: 63 to 75

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1109/RTSS49844.2020.00017