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

Keyphrases

• Hard Real-time 100%
• Probabilistic Graph 100%
• Expected Delay 100%
• Real-time Routing 100%
• Level of Assurance 66%
• Table-driven 66%
• Hard Deadline 66%
• Probabilistic Information 66%
• Probability Distribution 33%
• Information Theory 33%
• Probabilistic Learning 33%
• Learning-based 33%
• Routing Problem 33%
• Promising Direction 33%
• Safety Guarantee 33%
• Safety-critical Systems 33%
• Work Study 33%
• Trustworthiness 33%
• Worst-case Delay 33%
• Priori Estimates 33%
• Q-learning 33%
• High Assurance 33%
• Delay Probability 33%
• Comprehensive Solution 33%

Computer Science

• hard real-time 100%
• Hard Deadline 100%
• Routing Problem 50%
• Learning Approach 50%
• Safety Critical Systems 50%
• True Distribution 50%
• Delay Probability 50%