Results 251 to 260 of about 622,497 (296)

NbO_x Mott Memristor-Based Oscillatory P-trit for Ternary Potts Machine. [PDF]

Adv Sci (Weinh)
Rhee H, Jang S, Go TW, Park W, Kim G, Kim DH, Song H, Lee Y, Kang J, Kim D, Kim KM.   +10 more
europepmc   +1 more source

Particle sizing in milk by combined differential dynamic microscopy and cryo-FIB-SEM tomography.

Soft Matter
Bradley JJ, Laidlaw FHJ, Pendry T, Li NYD, Boggon AK, Glen T, Martinez VA, Arlt J, Thijssen JHJ, Poon WCK.   +9 more
europepmc   +1 more source

Maskit's Mathematical Contributions: The Smoothing Operator and DAAP Measures. [PDF]

J Psycholinguist Res
Susskind P.
europepmc   +1 more source

A Beginner's Guide to the Annex E Scoring System of ISO 10993-6. [PDF]

In Vivo
Barbeck M, Jung O, Korzinskas T.
europepmc   +1 more source

Dynamic financial tail risk networks: A backtesting-based conditional expected shortfall approach. [PDF]

PLoS One
Zhang D, Yan X, Shen F.
europepmc   +1 more source

The sum of weighted balls

, 1991
openaire   +1 more source

Asymptotics for Weighted Random Sums [PDF]

Advances in Applied Probability, 2012
Let {Xi} be a sequence of independent, identically distributed random variables with an intermediate regularly varying right tail F̄. Let (N, C1, C2,…) be a nonnegative random vector independent of the {Xi} with N∈ℕ∪ {∞}. We study the weighted random sum SN=∑{i=1}NCiXi, and its maximum, MN=sup{1≤kN+1∑i=1kCiXi.
Mariana Olvera-Cravioto
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

On the general trigonometric sums weighted by character sums

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Tian, Wei Yang, Liping Ding
openaire   +2 more sources

Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs

Journal of the Operational Research Society, 2009
The problem of scheduling in permutation flowshops is considered in this paper with the objectives of minimizing the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs, with each objective considered separately.
N. Madhushini, Chandrasekharan Rajendran, Y. Deepa   +2 more
openaire   +2 more sources