6251 search results - page 283 / 1251 » Randomness, Computability, and Density |
184
click to vote
PKC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
156
click to vote
WSC
2007
15 years 9 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
186
click to vote
WSC
2008
15 years 9 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
182
click to vote
AAAI
2004
15 years 8 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
155
click to vote
IOR
2010
15 years 5 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...