On Theoretical Upper Bounds for Routing Estimation.
Fei HeLerong ChengGuowu YangXiaoyu SongMing GuJia-Guang SunPublished in: J. Univers. Comput. Sci. (2005)
Keyphrases
- upper bound
- lower bound
- worst case
- estimation algorithm
- upper and lower bounds
- lower and upper bounds
- theoretical analysis
- tight bounds
- branch and bound
- shortest path
- routing problem
- branch and bound algorithm
- routing protocol
- sample size
- upper bounding
- error probability
- real time
- sample complexity
- maximum likelihood estimation
- generalization error
- parameter estimation
- supervised learning
- machine learning