Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds.
Gábor NémethGábor RétváriPublished in: BROADNETS (2010)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- single item
- tight bounds
- worst case
- theoretical analysis
- sample size
- routing protocol
- routing algorithm
- branch and bound
- ad hoc networks
- branch and bound algorithm
- hybrid learning
- optimal cost
- network topology
- sample complexity
- lead time
- b spline
- sensor networks
- genetic algorithm
- neural network