1369 search results - page 36 / 274 » Lattice computations for random numbers |
ISPA
2004
Springer
14 years 2 months ago
2004
Springer
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...
JDA
2008
13 years 8 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
SIAMSC
2010
13 years 7 months ago
2010
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
VOSS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...