Results 11  20
of
292
Previous Up Next Article Citations From References: 1 From Reviews: 0
"... Quasirandom graphs with given degree sequences. (English summary) ..."
#include <nagg05.h> void nag_quasi_random_uniform (Nag_QuasiRandom_State state,
"... To generate multidimensional quasirandom sequences with a uniform probability distribution. ..."
Abstract
 Add to MetaCart
To generate multidimensional quasirandom sequences with a uniform probability distribution.
NAG C Library Function Document nag_quasi_random_uniform (g05yac)
"... To generate multidimensional quasirandom sequences with a uniform probability distribution. ..."
Abstract
 Add to MetaCart
To generate multidimensional quasirandom sequences with a uniform probability distribution.
Simulation estimation of mixed discrete choice models using randomized and scrambled halton sequences
 Transportation Research Part B
, 2002
"... The use of simulation techniques has been increasing in recent years in the transportation and related fields to accommodate flexible and behaviorally realistic structures for analysis of decision processes. This paper proposes a randomized and scrambled version of the Halton sequence for use in sim ..."
Abstract

Cited by 119 (36 self)
 Add to MetaCart
The use of simulation techniques has been increasing in recent years in the transportation and related fields to accommodate flexible and behaviorally realistic structures for analysis of decision processes. This paper proposes a randomized and scrambled version of the Halton sequence for use
QuasiMonte Carlo Integration
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... The standard Monte Carlo approach to evaluating multidimensional integrals using (pseudo)random integration nodes is frequently used when quadrature methods are too difficult or expensive to implement. As an alternative to the random methods, it has been suggested that lower error and improved con ..."
Abstract

Cited by 73 (6 self)
 Add to MetaCart
convergence may be obtained by replacing the pseudorandom sequences with more uniformly distributed sequences known as quasirandom. In this paper the Halton, Sobol' and Faure quasirandom sequences are compared in computational experiments designed to determine the effects on convergence of certain
Comparison of Point Sets and Sequences for QuasiMonte Carlo and for Random Number Generation
"... Algorithmic random number generators require recurring sequences with very long periods and good multivariate uniformity properties. Point sets and sequences for quasiMonte Carlo numerical integration need similar multivariate uniformity properties as well. It then comes as no surprise that both ty ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Algorithmic random number generators require recurring sequences with very long periods and good multivariate uniformity properties. Point sets and sequences for quasiMonte Carlo numerical integration need similar multivariate uniformity properties as well. It then comes as no surprise that both
g05 – Random Number Generators g05ybc
"... nag_quasi_random_normal (g05ybc) To generate multidimensional quasirandom sequences with a Gaussian or lognormal probability distribution. ..."
Abstract
 Add to MetaCart
nag_quasi_random_normal (g05ybc) To generate multidimensional quasirandom sequences with a Gaussian or lognormal probability distribution.
#include <nagg05.h> void nag_quasi_random_uniform (Nag_QuasiRandom_State state,
"... nag_quasi_random_uniform (g05yac) To generate multidimensional quasirandom sequences with a uniform probability distribution. ..."
Abstract
 Add to MetaCart
nag_quasi_random_uniform (g05yac) To generate multidimensional quasirandom sequences with a uniform probability distribution.
QuasiMonte Carlo Radiosity
, 1996
"... The problem of global illumination in computer graphics is described by a second kind Fredholm integral equation. Due to the complexity of this equation, Monte Carlo methods provide an interesting tool for approximating solutions to this transport equation. For the case of the radiosity equation, w ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
, we present the deterministic method of quasirandom walks. This method very efficiently uses low discrepancy sequences for integrating the Neumann series and consistently outperforms stochastic techniques. The method of quasirandom walks also is applicable to transport problems in settings other
Girth of Sparse Graphs
 2002), 194  200. ILWOO CHO
"... Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0,1] 2 to the nonnegative reals, although the d ..."
Abstract

Cited by 78 (6 self)
 Add to MetaCart
aspects of this work is the message that sequences of inhomogeneous quasirandom graphs are in a
Results 11  20
of
292