Πλοήγηση ανά Θέμα "Non oblivious algorithm"
Αποτελέσματα 1-1 από 1
-
Conference Object
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control
(ACM, 1997)Lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, rate-based flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler ...