Login / Signup
An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks.
Sandeep Kumar Bijinemula
Aaron Willcock
Thidapat Chantem
Nathan Fisher
Published in:
RTSS (2018)
Keyphrases
</>
worst case
upper bound
lower bound
average case
decision making
knapsack problem
transfer learning
databases
running times
multiple tasks
times faster
search algorithm
approximation algorithms
multi task
artificial intelligence
neural network
data sets
worst case analysis