A Constant Approximation Algorithm for Sorting Buffers.
Jens S. KohrtKirk PruhsPublished in: LATIN (2004)
Keyphrases
- learning algorithm
- computational complexity
- preprocessing
- theoretical analysis
- similarity measure
- times faster
- dynamic programming
- experimental evaluation
- sorting algorithms
- improved algorithm
- recognition algorithm
- matching algorithm
- simulated annealing
- cost function
- optimal solution
- objective function
- probabilistic model
- state space
- worst case
- computational cost
- input data
- maximum likelihood
- computationally efficient
- np hard
- optimization algorithm
- detection algorithm
- production system
- multi objective
- significant improvement