1067 search results - page 116 / 214 » Probabilistic regular graphs |
119
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
100
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
113
click to vote
ARITH
2005
IEEE
15 years 8 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
116
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
110
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....