A path-based timing-driven quadratic placement algorithm.
Wenting HouXianlong HongWeimin WuYici CaiPublished in: ASP-DAC (2003)
Keyphrases
- search space
- computational cost
- similarity measure
- preprocessing
- experimental evaluation
- single pass
- path planning
- np hard
- dynamic programming
- worst case
- improved algorithm
- detection algorithm
- high accuracy
- learning algorithm
- image processing
- cost function
- significant improvement
- objective function
- upper bound
- experimental study
- optimization algorithm
- computationally efficient
- input data
- probabilistic model
- computational complexity
- particle swarm optimization
- matching algorithm
- times faster
- convex hull
- selection algorithm
- estimation algorithm
- feature selection