An Efficient and Robust Algorithm for Common Path Pessimism Removal In Static Timing Analysis.
Mengshi GongJie MaWenxin YuPublished in: ACM Great Lakes Symposium on VLSI (2023)
Keyphrases
- computationally efficient
- memory efficient
- improved algorithm
- search space
- recognition algorithm
- detection algorithm
- segmentation algorithm
- linear programming
- ant colony optimization
- optimization algorithm
- optimal solution
- cost function
- dynamic programming
- times faster
- computational cost
- worst case
- high accuracy
- simulated annealing
- learning algorithm
- expectation maximization
- significant improvement
- highly efficient
- kalman filter
- convergence rate
- similarity measure
- k means
- estimation algorithm
- optimal path
- genetic algorithm
- matching algorithm
- objective function
- preprocessing
- theoretical analysis
- particle swarm optimization
- data sets
- probabilistic model
- experimental evaluation
- np hard