Results 211 to 220 of about 188,891 (256)

Complete convergence and complete moment convergence for martingale difference sequence

Acta Mathematica Sinica, English Series, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Xue Jun, Hu, Shu He
exaly   +3 more sources

Equivalent conditions of complete convergence and complete moment convergence for END random variables

Chinese Annals of Mathematics Series B, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aiting Shen, Shen Aiting, Mei Yao
exaly   +2 more sources

On Convergence of Sequences in Complete Lattices

Order, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Complete Convergence of Martingale Arrays

Journal of Theoretical Probability, 1998
A sequence \(\{U_n, n\geq 1\}\) of random variables is said to converge completely to the constant \(c\) if \(\sum^\infty_{n= 1} P(| U_n- c|> \varepsilon)< \infty\) for all \(\varepsilon> 0\). The definition was introduced by \textit{P. L. Hsu} and \textit{H. Robbins} [Proc. Natl. Acad. Sci.
Ghosal, Subhashis, Chandra, Tapas K.
openaire   +1 more source

Completion of Semiuniform Convergence Spaces

Applied Categorical Structures, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Complete Convergence of the Directed TSP

Mathematics of Operations Research, 1991
Consider the random directed graph Gn whose vertices X1, …, Xn are independent uniformly distributed over [0, 1]2. For 1 ≤ i < j ≤ n, the orientation of the edge XiXj is selected at random, independently for each edge and independently of the Xi's. Denote by Un the length of the shortest path through Gn.
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

Completing the convergence puzzle: a survey and a roadmap

IEEE Wireless Communications, 2009
Convergence has more than ever been a central issue for fixed and mobile operators throughout the world and is considered to be the next big step in the evolution of telecommunication networks. Convergence opens new market opportunities and competition among network operators and above all offers enhanced user experience.
Meddour D.-E., Javaid U., Bihannic N., Rasheed T., Boutaba R.   +4 more
openaire   +1 more source

The Complete Convergence of Best 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,...,X_ n,..\). distributed according to \(\mu\). No regularity assumptions are made on \(\mu\). Denote by \(B(X_ 1,...,X_ n)\) the number of unit-size bins that are used by Best Fit Decreasing to pack items of size \(X_ 1,...,X_ n\).
Wansoo T. Rhee, Michel Talagrand
openaire   +1 more source