4377 search results - page 184 / 876 » Mass problems and randomness |
181
click to vote
PPL
2000
15 years 6 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
195
click to vote
FSS
2011
15 years 1 months ago
2011
We review two existing interpretations of fuzzy random variables. In the first one, the fuzzy random variable is viewed as a linguistic random variable. In the second case, it re...
182
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
166
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
172
click to vote
APPROX
2005
Springer
16 years 3 days ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...