Approximate Algorithms Scheduling Parallelizable Tasks.
John TurekJoel L. WolfPhilip S. YuPublished in: SPAA (1992)
Keyphrases
- computational cost
- recently developed
- computational complexity
- theoretical analysis
- learning algorithm
- machine learning
- data structure
- scheduling problem
- machine learning algorithms
- benchmark datasets
- orders of magnitude
- exact and approximate
- data mining tasks
- convergence rate
- times faster
- computational efficiency
- computationally efficient
- worst case
- upper bound
- evolutionary algorithm
- database systems