Sciweavers

932 search results - page 24 / 187
» Uniform Random Number Generators
Sort
View
RSA
2000
170views more  RSA 2000»
14 years 9 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
82
Voted
WSC
2000
14 years 11 months ago
Generating "dependent" quasi-random numbers
Under certain conditions on the integrand, quasi-Monte Carlo methods for estimating integrals (expectations) converge faster asymptotically than Monte Carlo methods. Motivated by ...
Shane G. Henderson, Belinda A. Chiera, Roger M. Co...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
15 years 3 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
ENDM
2008
118views more  ENDM 2008»
14 years 9 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...