On polynomial complexity of a stochastic algorithm for mixed zero-one programs.
Raj JagannathanPublished in: Discret. Appl. Math. (2004)
Keyphrases
- computational complexity
- objective function
- space complexity
- experimental evaluation
- learning algorithm
- high accuracy
- detection algorithm
- times faster
- computational cost
- dynamic programming
- cost function
- k means
- linear complexity
- memory requirements
- improved algorithm
- high computational complexity
- monte carlo
- optimization algorithm
- similarity measure
- worst case
- preprocessing
- convex hull
- np hard
- hidden markov models
- optimal solution
- polynomial size
- linear programming
- particle swarm optimization
- denoising
- upper bound
- scheduling problem
- convergence rate
- recognition algorithm
- bayesian networks
- polynomial time complexity