2996 search results - page 109 / 600 » Numberings and Randomness |
157
click to vote
ECCC
2011
15 years 8 days ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
140
click to vote
ENTCS
2008
15 years 5 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
148
click to vote
EPEW
2006
Springer
15 years 9 months ago
2006
Springer
Benchmarking as a method of assessing software performance is known to suffer from random fluctuations that distort the observed performance. In this paper, we focus on the fluctua...
147
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
120
click to vote
SPDP
1991
IEEE
15 years 8 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...