Rigorous Estimation of Computational Complexity for OMV SAT Algorithm.
Satoshi IriyamaMasanori OhyaPublished in: Open Syst. Inf. Dyn. (2008)
Keyphrases
- computational complexity
- estimation algorithm
- computationally efficient
- computational efficiency
- preprocessing
- objective function
- detection algorithm
- np hard
- dynamic programming
- experimental evaluation
- times faster
- parameter estimation
- high accuracy
- randomly generated
- computational cost
- cost function
- search space
- learning algorithm
- recognition algorithm
- neural network
- linear computational complexity
- k means
- optimal solution
- segmentation algorithm
- worst case
- high computational complexity