4377 search results - page 72 / 876 » Mass problems and randomness |
MST
2007
14 years 9 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
IJCNN
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
WSC
2008
15 years 5 days ago
2008
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...
WSC
2001
14 years 11 months ago
2001
The requirements, design principles, and statistical testing approaches of uniform random number generators for simulation are briefly surveyed. An objectoriented random number pa...