Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
Tomás EbenlendrJirí SgallPublished in: STACS (2009)
Keyphrases
- learning algorithm
- experimental evaluation
- dynamic programming
- k means
- preprocessing
- preemptive scheduling
- worst case
- computational cost
- np hard
- optimization algorithm
- theoretical analysis
- cost function
- optimal solution
- times faster
- search space
- input data
- real time
- improved algorithm
- recognition algorithm
- objective function
- high accuracy
- image segmentation
- expectation maximization
- probabilistic model
- constraint satisfaction problems
- image sequences
- tree structure
- matching algorithm
- significant improvement
- computational complexity
- related algorithms
- passive aggressive
- evolutionary algorithm