English Poisson point process Cited by user Bender235 on 15 May 2020 In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical…
Catalan Cua D/M/1 Cited by user Jaumellecha on 06 Dec 2019 En teoria de cues, una disciplina dins de la teoria matemàtica de la probabilitat, una cua D/M/1 representa la longitud de la cua en un sistema amb un servidor únic, on…
Catalan Cua M/D/c Cited by user Jaumellecha on 01 Jun 2019 En la teoria de cues, una disciplina dins de la teoria matemàtica de la probabilitat, una cua M/D/c representa la longitud de la cua en un sistema amb
Spanish Fórmula Pollaczek-Khintchine Cited by user GonzaloSalvador on 25 May 2019 En teoría de colas, una disciplina dentro de la teoría de la probabilidad, la fórmula de Pollaczek–Khinchine establece una relación entre la longitud de la cola y las…
Romanian Teoria statului la coadă Cited by user Grintescu on 19 May 2018 [[Fișier:ServidorParalelo.jpg|dreapta|miniatura|Rețelele de cozi sunt sisteme în care cozile cu un singur rând sunt conectate printr-o rețea de rutare.
Catalan Fórmula de Pollaczek–Khinchine Cited by user Jordiventura96 on 11 Mar 2016 En teoria de cues, una disciplina que s'engloba dins de la teoria de la probablitat, la fórmula de Pollaczek–Khinchine afirma que hi ha una relació entre la longitud de…
English M/D/c queue Cited by user Gareth Jones on 14 Jun 2013 In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals…
English M/G/k queue Cited by user Gareth Jones on 12 Jun 2013 In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian (modulated by a Poisson…
English D/M/1 queue Cited by user Gareth Jones on 13 Feb 2013 In queueing theory, a discipline within the mathematical theory of probability, an D/M/1 queue represents the queue length in a system having a single server, where…
German Pollaczek-Chintschin-Formel Cited by user Frantisek on 09 Feb 2013 In der Warteschlangentheorie, einem Teilgebiet der Wahrscheinlichkeitstheorie, ist die Pollaczek-Chintschin-Formel eine Formel zur Berechnung der mittleren…
Hungarian M/G/1-típusú sorbanállás Cited by user Lamarit on 31 Jan 2013 A sorbanállás-elméletben az M/G/1-típusú sorbanállás olyan sorbanállási modell, ahol a beérkező entitások véletlenszerűek (M), a Poisson-folyamat szerint, a szolgáltatási…
Hungarian Pollaczek–Khinchine-formula Cited by user Lamarit on 27 Jan 2013 A sorbanállás-elméletben a Pollaczek–Khinchine-formula kifejezi az átlagos sorbanállási hosszúságot, ahol a feladatok a Poisson-folyamat szerint érkeznek, és a szolgáltatá…
English M/D/1 queue Cited by user Gareth Jones on 05 Dec 2012 In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where…
English Queueing theory Cited by user Gareth Jones on 05 Dec 2012 Queueing theory is the mathematical study of waiting lines, or queues. In queueing theory a model is constructed so that queue lengths and waiting times can be predicted.
English Lindley equation Cited by user Gareth Jones on 02 Nov 2011 In probability theory, the Lindley equation, Lindley recursion or Lindley processes is a discrete-time stochastic process An where n takes integer values and.
English Pollaczek–Khinchine formula Cited by user Gareth Jones on 02 Nov 2011 In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and…