An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix.
Kiril KolchakovTasho D. TashevPublished in: CompSysTech (2012)
Keyphrases
- learning algorithm
- detection algorithm
- computational complexity
- dynamic programming
- times faster
- optimization algorithm
- scheduling problem
- cost function
- search space
- preprocessing
- optimal solution
- computational cost
- experimental evaluation
- neural network
- np hard
- data structure
- significant improvement
- k means
- high accuracy
- input data
- particle swarm optimization
- expectation maximization
- theoretical analysis
- segmentation algorithm
- objective function
- improved algorithm
- matching algorithm
- critical path
- decision trees
- similarity measure
- evolutionary algorithm