2996 search results - page 103 / 600 » Numberings and Randomness |
92
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
142
click to vote
SIGCOMM
1997
ACM
15 years 5 months ago
1997
ACM
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to con...
105
click to vote
ECCC
2000
15 years 17 days ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
113
click to vote
RSA
2008
15 years 7 days ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
115
click to vote
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...