Sciweavers

22 search results - page 5 / 5
» Performance Modelling of Necklace Hypercubes
Sort
View
SPAA
1994
ACM
13 years 9 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
DT
2006
98views more  DT 2006»
13 years 5 months ago
Handling variations and uncertainties
The widely used engineering decisions concerning the performance of technological equipment for process industries are usually deterministic. Since the early 1990s probabilistic m...
Tim Cheng