Login / Signup
Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters.
Nathan Fisher
Thi Huyen Chau Nguyen
Joël Goossens
Pascal Richard
Published in:
RTCSA (2007)
Keyphrases
</>
response time
worst case
computational complexity
optimization problems
higher priority
decision trees
data structure
theoretical analysis
computationally efficient
randomized algorithms
average case
error bounds
learning algorithm
computational cost
greedy algorithm
orders of magnitude
pac bayesian