Algorithms for Minclique Scheduling Problems.
Bernd JurischWieslaw KubiakJoanna JózefowskaPublished in: Discret. Appl. Math. (1997)
Keyphrases
- scheduling problem
- times faster
- neural network
- computational cost
- graph theory
- orders of magnitude
- significant improvement
- computational complexity
- data structure
- computer vision
- machine learning
- data sets
- learning algorithm
- upper bound
- semi supervised
- worst case
- theoretical analysis
- data mining
- data mining algorithms
- benchmark problems
- real time