An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations.
Sampath DechuZion Cien ShenChris C. N. ChuPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2005)
Keyphrases
- tree construction
- k means
- preprocessing
- segmentation algorithm
- worst case
- dynamic programming
- expectation maximization
- probabilistic model
- learning algorithm
- objective function
- feature space
- information retrieval systems
- computational complexity
- detection algorithm
- np hard
- evolutionary algorithm
- computationally efficient
- training data