Results 281 to 290 of about 541,185 (309)
Some of the next articles are maybe not open access.
Quasi-random integration in high dimensions
Mathematics and Computers in Simulation, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Takhtamyshev +2 more
openaire +1 more source
1998
We present the method of the quasi-random walk for the approximation of functionals of the solution of second kind Fredholm integral equations. This deterministic approach efficiently uses low discrepancy sequences for the quasi-Monte Carlo integration of the Neumann series.
openaire +1 more source
We present the method of the quasi-random walk for the approximation of functionals of the solution of second kind Fredholm integral equations. This deterministic approach efficiently uses low discrepancy sequences for the quasi-Monte Carlo integration of the Neumann series.
openaire +1 more source
Quasi‐random 2‐ colorings of point sets
Random Structures & Algorithms, 1991AbstractGiven an arbitrary set of N points on the plane, one can two‐color the points red and blue in such a way that the difference of the numbers of red and blue points in any half‐plane has absolute value less than N1/4(log N)4. This is essentially best possible.
openaire +2 more sources
Quasi-random access memory systems
Papers and discussions presented at the December 10-12, 1956, eastern joint computer conference: New developments in computers on - AIEE-IRE '56 (Eastern), 1957Synopsis: To select an economical memory for business data-processing systems, the memory characteristics must be matched to the work cycle, processing rate, and permissible delay time of the system. Quasi-random systems feature the low memory cost of serial memories, high processing rates, short delay times, and minimum sorting.
openaire +1 more source
Hypergraph regularity and quasi-randomness
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009Brendan Nagle +3 more
openaire +1 more source
Linear quasi-randomness of subsets of abelian groups and hypergraphs
Electronic Notes in Discrete Mathematics, 2017Elad Aigner-Horev, Hiep Han
exaly
Generating "dependent" quasi-random numbers
2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165), 2002Shane G. Henderson +2 more
openaire +1 more source
Weak quasi‐randomness for uniform hypergraphs
Random Structures and Algorithms, 2012David Conlon, Hiep Han, Yury Person
exaly
Linear quasi-randomness of subsets of abelian groups and hypergraphs
European Journal of Combinatorics, 2020Elad Aigner-Horev, Hiep Han
exaly