1369 search results - page 117 / 274 » Lattice computations for random numbers |
LSSC
2001
Springer
14 years 1 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 ...
RANDOM
1998
Springer
14 years 1 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
MFCS
2000
Springer
14 years 19 days ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
HIPC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...