Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net.
Peter KemperPublished in: Application and Theory of Petri Nets (1993)
Keyphrases
- worst case
- strongly connected
- optimization algorithm
- dynamic programming
- detection algorithm
- optimal solution
- k means
- objective function
- learning algorithm
- computational complexity
- theoretical analysis
- probabilistic model
- preprocessing
- significant improvement
- recognition algorithm
- expectation maximization
- particle swarm optimization
- clustering method
- computational cost
- times faster
- input data
- simulated annealing
- high accuracy
- probability distribution
- neural network
- np hard
- cost function
- special case
- search space
- image sequences
- feature selection
- genetic algorithm