Sciweavers

1806 search results - page 53 / 362
» Randomness and halting probabilities
Sort
View
RSA
2002
71views more  RSA 2002»
13 years 8 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
ALT
2007
Springer
14 years 5 months ago
On Calibration Error of Randomized Forecasting Algorithms
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
Vladimir V. V'yugin
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
14 years 14 days ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer
WSC
2008
13 years 11 months ago
A plug-in-based architecture for random number generation in simulation systems
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...
Roland Ewald, Johannes Rossel, Jan Himmelspach, Ad...
ALENEX
2004
120views Algorithms» more  ALENEX 2004»
13 years 10 months ago
Compositions and Patricia Tries: No Fluctuations in the Variance!
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
Helmut Prodinger