1618 search results - page 156 / 324 » Testing random number generators |
127
Voted
LSSC
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
120
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
115
click to vote
CCA
2000
Springer
15 years 6 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
136
Voted
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
136
click to vote
TCS
2008
15 years 2 months ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...