An efficient algorithm for buffered routing tree construction under fixed buffer locations with accurate delay models.
Yiqian ZhangXianlong HongYici CaiPublished in: ISCAS (1) (2005)
Keyphrases
- tree construction
- computationally efficient
- dynamic programming
- buffer size
- learning algorithm
- high accuracy
- probabilistic model
- np hard
- k means
- objective function
- computational complexity
- mining high utility itemsets
- high dimensional
- data structure
- input data
- optimal solution
- tree structure
- training data
- databases
- database