An Efficient Algorithm for Finding a Universal Set of Testable Long Paths.
Zijian HeTao LvHuawei LiXiaowei LiPublished in: Asian Test Symposium (2010)
Keyphrases
- computationally efficient
- computational cost
- experimental evaluation
- detection algorithm
- cost function
- k means
- learning algorithm
- computational complexity
- np hard
- initial set
- improved algorithm
- times faster
- nearest neighbour
- optimal path
- method finds
- lower and upper bounds
- image set
- convex hull
- decomposition algorithm
- path planning
- segmentation algorithm
- particle swarm optimization
- input data
- simulated annealing
- worst case
- objective function
- optimization algorithm
- clustering method
- theoretical analysis
- linear programming
- convergence rate
- search space
- optimal solution
- image segmentation
- input pattern
- neural network