An approximation algorithm for fully testable kEP-SOP networks.
Anna BernasconiValentina CirianiRoberto CordonePublished in: ACM Great Lakes Symposium on VLSI (2007)
Keyphrases
- learning algorithm
- approximation ratio
- improved algorithm
- np hard
- times faster
- preprocessing
- probabilistic model
- particle swarm optimization
- clustering method
- detection algorithm
- optimization algorithm
- expectation maximization
- high accuracy
- cost function
- linear programming
- dynamic programming
- computationally efficient
- theoretical analysis
- k means
- computational complexity
- computational cost
- approximation algorithms
- tree structure
- social networks
- polygonal approximation
- fully connected
- objective function
- error bounds
- optimal solution
- closed form
- classification algorithm
- monte carlo
- search space
- experimental evaluation
- worst case