نتایج جستجو برای: stochastic
تعداد نتایج: 125739 فیلتر نتایج به سال:
Let T be an arbitrary n × n matrix with real entries. We explicitly find the closest (in Frobenius norm) matrix A to T , where A is n × n with real entries, subject to the condition that A is “generalized doubly stochastic” (i.e. Ae = e and eA = e , where e = (1, 1, ..., 1) , although A is not necessarily nonnegative) and A has the same first moment as T (i.e. eT1 Ae1 = e T 1 Te1). We also expl...
It is well known that the stochastic optimization problem can be regarded as one of most hard problems since, in cases, values f and its gradient are often not easily to solved, or F(∙, ξ) normally given clearly (or) distribution function P equivocal. Then an effective algorithm successfully designed used solve this interesting work. This paper designs bigger subspace algorithms for solving non...
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید