A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets.
Javier EsparzaManuel Silva SuárezPublished in: Theor. Comput. Sci. (1992)
Keyphrases
- detection algorithm
- computational complexity
- preprocessing
- experimental evaluation
- high accuracy
- learning algorithm
- worst case
- k means
- cost function
- simulated annealing
- probabilistic model
- dynamic programming
- theoretical analysis
- segmentation algorithm
- times faster
- optimal solution
- improved algorithm
- data sets
- polynomial size
- special case
- significant improvement
- linear programming
- expectation maximization
- optimization algorithm
- search space
- clustering method
- lower bound
- convex hull
- recognition algorithm
- similarity measure
- randomized algorithm
- minimum length
- neural network