2996 search results - page 29 / 600 » Numberings and Randomness |
WSC
2000
13 years 11 months ago
2000
Under certain conditions on the integrand, quasi-Monte Carlo methods for estimating integrals (expectations) converge faster asymptotically than Monte Carlo methods. Motivated by ...
CAI
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
WIMOB
2007
IEEE
14 years 4 months ago
2007
IEEE
As part of the IEEE 802.16 protocol, the random access scheme is used for ranging. The ratio between the numbers of periodic ranging slots and data slots in the uplink subframe de...
ENDM
2000
13 years 9 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
JCT
2010
13 years 8 months ago
2010
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...