Queue assignment for fixed-priority real-time flows in time-sensitive networks: Hardness and algorithm.
Yuhan LinXi JinTianyu ZhangMeiling HanNan GuanQingxu DengPublished in: J. Syst. Archit. (2021)
Keyphrases
- real time
- learning algorithm
- np hard
- preprocessing
- dynamic programming
- computational complexity
- experimental evaluation
- linear programming
- high accuracy
- optimization algorithm
- detection algorithm
- search space
- cost function
- optimal solution
- fixed size
- computational cost
- probabilistic model
- worst case
- matching algorithm
- np hardness
- moving target
- randomly generated
- social networks
- image sequences
- objective function
- evolutionary algorithm