An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation.
Jan Friso GrooteAnton WijsPublished in: CoRR (2016)
Keyphrases
- worst case
- preprocessing
- computational complexity
- times faster
- experimental evaluation
- dynamic programming
- high accuracy
- cost function
- learning algorithm
- computational cost
- significant improvement
- selection algorithm
- np hard
- recognition algorithm
- optimal solution
- objective function
- clustering algorithm
- expectation maximization
- matching algorithm
- theoretical analysis
- memory requirements
- branch and bound
- convex hull
- data sets
- path planning
- detection algorithm
- segmentation algorithm
- linear programming
- bayesian networks
- search algorithm
- k means