Throughput and Delay Bounds for Input Buffered Switches Using Maximal Weight Matching Algorithms and a Speedup of Less than Two.
Claus BauerPublished in: ICOIN (2004)
Keyphrases
- orders of magnitude
- computationally efficient
- worst case
- buffer size
- neural network
- data structure
- computational cost
- decision trees
- theoretical analysis
- genetic algorithm
- error bounds
- average case
- lower bound
- learning algorithm
- constraint satisfaction problems
- machine learning algorithms
- keypoints
- randomized algorithms
- data mining