نتایج جستجو برای: the divisible un
تعداد نتایج: 16201837 فیلتر نتایج به سال:
introduction le pronom (complément) est un nom grammatical qui remplace un nom ou une phrase ou bien une locution nominale. les pronoms (compléments) sont de divers genres dont les plus importants sont: les pronoms sujets, d objets, possessifs; réfléchis, dénominatifs, relatifs, et interrogatifs parmi lesquels les pronoms sujets; d objets; possessifs et réfléchis sont considérés les pronoms...
We study the freely infinitely divisible distributions that appear as the laws of free subordinators. This is the free analog of classically infinitely divisible distributions supported on [0,∞), called the free regular measures. We prove that the class of free regular measures is closed under the free multiplicative convolution, t boolean power for 0 ≤ t ≤ 1, t free multiplicative power for t ...
A divisible load (job, task) can be arbitrarily divided into independent small load fractions which are assigned to processors in a parallel or distributed computing system for simultaneous processing. Given an arbitrarily divisible load without precedence constraint and a parallel/distributed computing system with communication delays, the problem of divisible load distribution is to find the ...
Clinical interviews administered to third- to sixth-graders explored children's conceptualizations of rational number and of certain extensive physical quantities. We found within child consistency in reasoning about diverse aspects of rational number. Children's spontaneous acknowledgement of the existence of numbers between 0 and 1 was strongly related to their induction that numbers are infi...
We prove that a stationary max–infinitely divisible process is mixing (ergodic) iff its dependence function converges to 0 (is Cesaro summable to 0). These criteria are applied to some classes of max–infinitely divisible processes.
In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. The problem is to show optimal divisible load schedules for various network topologies have Markov chain analogs. This paper is a continuation of our initial short paper [1] that introduced this unification between divisible load theory and Markov chain models for ...
In the class of abelian groups a subclass of two-divisible-groups is singled out, and in the latter, a subclass of uniquely-two-divisible-groups. With every such a group a special geometrical structure, more precisely the structure of “congruence of vectors” is correlated. The notion of “affine vector space” (denoted by AffVect) is introduced. This term is defined by means of suitable axiom sys...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید