A Dynamic Algorithm for Online Scheduling of Parallel Processes.
Constantinos V. PapadopoulosPublished in: PARLE (1994)
Keyphrases
- computational complexity
- experimental evaluation
- dynamic programming
- worst case
- computational cost
- times faster
- real time
- high accuracy
- optimal solution
- parallel implementation
- matching algorithm
- np hard
- search space
- learning algorithm
- computationally efficient
- parallel processors
- passive aggressive
- linear programming
- cost function
- significant improvement
- preprocessing
- simulated annealing
- online learning
- particle swarm optimization
- scheduling problem
- optimization algorithm
- detection algorithm
- objective function
- social networks