نتایج جستجو برای: generating random variables
تعداد نتایج: 666238 فیلتر نتایج به سال:
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
abstract: one of the most visited & important spaces in different countries by tourist are urban areas. the old tehran which major part is located in district 12 is historical showcase of the capital, but, its hiidden cultural attraction is not used as it should be. this thesis occasionally engage in studying the efficacy of correct installation of travel guide boards in welfare & easily acc...
Several techniques of generating random quantum channels, which act on the set $d$-dimensional states, are investigated. We present three approaches to problem sampling channels and show under conditions they become mathematically equivalent, lead uniform, Lebesgue measure convex operations. compare their advantages computational complexity demonstrate them is particularly suitable for numerica...
In [9] we introduced a new framework for asymptotic probabilities. in which a r i-add~t~ve measure is defined on the sample space of all sequences A =< dl.d?. . d, > of finite models. where the uniberse of sf,, is { I . 2. ...n ) . In this framework we Investigated the strong 0-1 law for sentences. whlch states that each sentence either holds in d,, eventually almost surely or fails In d,, even...
Continuous stress–strength interference (SSI) model regards stress and strength as continuous random variables with known probability density function. This, to some extent, results in a limitation of its application. In this paper, stress and strength are treated as discrete random variables, and a discrete SSI model is presented by using the universal generating function (UGF) method. Finally...
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associat...
The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired by the fruitfulness of the established model for generating random SAT instances, we define and study a general model for generating random QBF instances. We exhibit experimental results showing that ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید