2996 search results - page 6 / 600 » Numberings and Randomness |
ISCAS
2006
IEEE
14 years 3 months ago
2006
IEEE
— The paper presents a simple stochastic model of a True Random Number Generator, which extracts randomness from the tracking jitter of a phase-locked loop. The existence of such...
RSA
2008
13 years 9 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
ARC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
RSA
2002
13 years 9 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
WSC
2008
14 years 4 days ago
2008
Suppose one wishes to compare two closely related systems via stochastic simulation. Common random numbers (CRN) involves using the same streams of uniform random variates as inpu...