An approach for performance improvement of class of algorithms for synthesis of non-conflict schedule in the switch nodes.
Kiril KolchakovPublished in: CompSysTech (2010)
Keyphrases
- computational complexity
- theoretical analysis
- learning algorithm
- times faster
- data structure
- scheduling problem
- convex optimization problems
- significant improvement
- data sets
- orders of magnitude
- computational cost
- computational efficiency
- simulated annealing
- worst case
- np hard
- clustering algorithm
- genetic algorithm