A novel timing-driven placement algorithm using smooth timing analysis.
Andrey AyupovLeonid KraginskiyPublished in: EWDTS (2008)
Keyphrases
- optimization algorithm
- computationally efficient
- np hard
- learning algorithm
- detection algorithm
- experimental evaluation
- dynamic programming
- cost function
- single pass
- estimation algorithm
- experimental study
- computational complexity
- preprocessing
- selection algorithm
- recognition algorithm
- optimal solution
- theoretical analysis
- computational cost
- particle swarm optimization
- worst case
- search algorithm
- probabilistic model
- clustering method
- multiscale
- tree structure
- times faster
- search space
- improved algorithm
- clustering algorithm
- neural network