Improved worst-case response-time calculations by upper-bound conditions.
Victor PollexSteffen KollmannKarsten AlbersFrank SlomkaPublished in: DATE (2009)
Keyphrases
- upper bound
- response time
- worst case
- lower bound
- additive error
- prefetching
- sufficient conditions
- branch and bound algorithm
- scheduling algorithm
- branch and bound
- average case
- higher priority
- error bounds
- np hard
- query execution
- worst case analysis
- lower and upper bounds
- greedy algorithm
- generalization error
- space complexity
- storage space
- error probability
- quality of service
- network latency
- worst case scenario
- constant factor
- improved algorithm
- data mining
- approximation algorithms
- sample size