Results 281 to 290 of about 6,294,373 (325)

The Complete Convergence of First Fit Decreasing

SIAM Journal on Computing, 1989
Summary: Consider a probability measure \(\mu\) on [0,1] and an independent sequence of random variables \(X_ 1,\cdot \cdot \cdot,X_ n,\cdot \cdot \cdot\) distributed according to \(\mu\). No regularity assumptions are made on \(\mu\). Denote by \(F_ n(X_ 1,\cdot \cdot \cdot,X_ n)\) the number of unit-size bins that are used by First Fit Decreasing to ...
Wansoo T. Rhee, Michel Talagrand
openaire   +2 more sources

On the Complete Convergence of Bordered Nets

IEEE Transactions on Electronic Computers, 1967
A procedure is described for minimizing the number of states in an asynchronous sequential function when the restriction exists that the input cannot change while the sequential function is in an unstable state. Furthermore, a procedure is described for minimizing the number of states in a sequential function when the restriction also exists that each ...
openaire   +1 more source

A supplement to the complete convergence

Statistics & Probability Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Weidong, Lin, Zhengyan
openaire   +1 more source

On complete convergence for arrays

Statistics & Probability Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kruglov, Victor M., Volodin, Andrei I., Hu, Tien-Chung   +2 more
openaire   +2 more sources

Convergence And Completeness

2008
Abstract We have already noted some seventeenth- and eighteenth-century discussions of convergence (or the lack of them) in 8.3, and in this Chapter we take up the nineteenth-century continuation of the same story. One of the most powerful tools available to early nineteenth-century mathematicians investigating convergence turned out to ...
openaire   +2 more sources

Completely Convex Functions and Convergence

SIAM Journal on Mathematical Analysis, 1979
A function $f(x)$ is completely convex (c.c.) on $[0,1]$ if $( - 1)^k f^{(2k)} (x) \geqq 0$ for $k \geqq 0$ and all x in $[0,1]$. This paper studies the convergence of the partial sums of the Maclaurin series of the function; in particular, how quickly the partial sums turn into a c.c. function. It is shown that no matter where the series is truncated,
openaire   +2 more sources

Complete Convergence of Weighted Sums of Martingale Differences and Statistical Applications

Bulletin of the Malaysian Mathematical Sciences Society, 2023
Yu Miao, Mengying Shao
semanticscholar   +1 more source

Complete moment convergence and complete convergence for weighted sums of NSD random variables

Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Xin, Wang, Xuejun, Wu, Yi, Ding, Yang   +3 more
openaire   +1 more source

Complete convergence for arrays

Periodica Mathematica Hungarica, 1992
Let \(\{(X_{nk}\), \(1\leq k\leq n)\), \(n\geq 1\}\) be an array of rowwise independent random variables. We extend and generalize some recent results due to \textit{T.-C. Hu}, \textit{F. Móricz} and \textit{R. L. Taylor} [Acta Math. Hung. 54, No. 1/2, 153-162 (1989; Zbl 0685.60032)] concerning complete convergence, in the sense of \textit{P. L.
openaire   +1 more source

Complete convergence for α-mixing sequences

Statistics & Probability Letters, 1993
Let \(X_ n\) be a sequence of \(\alpha\)-mixing random variables with mean zero, uniformly bounded \(r\)-th moments and the mixing coefficient \(\alpha(n)\) and let \(S_ n\) denote the partial sum of the first \(n\) \(X\) variables. It is proved that for any \(\varepsilon>0\), \[ \sum^ \infty_{n=1}n^{p\alpha-2}P\left(\max_{i\leq n}| S_ i|\geq ...
openaire   +1 more source