Exploiting Unused Periodic Time for Aperiodic Service Using the Extended Priority Exchange Algorithm.
Brinkley SpruntJohn P. LehoczkyLui ShaPublished in: RTSS (1988)
Keyphrases
- learning algorithm
- computational complexity
- recognition algorithm
- cost function
- improved algorithm
- simulated annealing
- objective function
- optimal solution
- search space
- worst case
- dynamic programming
- experimental evaluation
- segmentation algorithm
- computationally efficient
- theoretical analysis
- path planning
- detection algorithm
- convergence rate
- high accuracy
- np hard
- significant improvement
- preprocessing
- data sets
- selection algorithm
- memory requirements
- priority queue
- times faster
- steady state
- matching algorithm
- input data
- probabilistic model
- reinforcement learning
- genetic algorithm