932 search results - page 55 / 187 » Uniform Random Number Generators |
104
click to vote
ICST
2008
IEEE
15 years 4 months ago
2008
IEEE
Intuition suggests that random testing of object-oriented programs should exhibit a high difference in the number of defects detected by two different runs over the same amount of...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
109
click to vote
SIAMCOMP
2012
13 years 6 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
WSCG
2004
14 years 11 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
112
click to vote
FPGA
2000
ACM
15 years 1 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...