Optimality and Stability Study of Timing-Driven Placement Algorithms.
Jason CongMichail RomesisMin XiePublished in: ICCAD (2003)
Keyphrases
- computational cost
- orders of magnitude
- neural network
- recently developed
- times faster
- empirical studies
- statistical analysis
- theoretical framework
- worst case
- computationally efficient
- theoretical analysis
- stability of feature selection
- computationally expensive
- experimental study
- significant improvement
- computational complexity
- data structure
- feature selection
- machine learning