Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler.
Zyad DwekatGeorge N. RouskasPublished in: ICC (2011)
Keyphrases
- worst case
- average case
- lower bound
- error bounds
- approximation algorithms
- upper bound
- np hard
- space complexity
- greedy algorithm
- running times
- computational complexity
- variable sized
- worst case analysis
- scheduling algorithm
- multi unit combinatorial auctions
- data sets
- multi objective
- expert systems
- knowledge base
- information systems
- computer vision
- artificial intelligence
- data mining