A probabilistic algorithm to test local algebraic observability in polynomial time.
Alexandre SedoglavicPublished in: ISSAC (2001)
Keyphrases
- worst case
- probabilistic model
- learning algorithm
- detection algorithm
- objective function
- simulated annealing
- computational complexity
- computational cost
- k means
- strongly polynomial
- experimental evaluation
- preprocessing
- optimal solution
- np hard
- dynamic programming
- significant improvement
- polynomial size
- high accuracy
- em algorithm
- optimization algorithm
- matching algorithm
- tree structure
- similarity measure
- multi objective
- recognition algorithm
- convergence rate
- ant colony optimization
- bayesian networks
- input data
- linear programming
- search space
- evolutionary algorithm