2735 search results - page 304 / 547 » Comparing notions of randomness |
107
click to vote
APNOMS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
96
Voted
EURODAC
1995
IEEE
15 years 4 months ago
1995
IEEE
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
INFOCOM
1989
IEEE
15 years 4 months ago
1989
IEEE
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
123
Voted
WSC
2004
15 years 2 months ago
2004
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
89
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...