The loss of serving in the dark

We study the following balls and bins stochastic process: There is a buffer with B bins, and there is a stream of balls X=〈X1,X2,…,XT〉 such that Xi is the number of balls that arrive before time i but after time i−1. Once a ball arrives, it is stored in one of the unoccupied bins. If all the bins ar...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 180; s. 106334
Hlavní autori:	Azar, Yossi, Cohen, Ilan Reuven, Gamzu, Iftah
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2023
Predmet:	Oblivious algorithms Online algorithms Prompt mechanisms Randomized algorithms Scheduling Oblivious algorithms Online algorithms Randomized algorithms Scheduling Prompt mechanisms
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!