Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kochalski, Katelynn D."'
We consider a sequence of single-server queueing models operating under a service policy that incorporates batches into processor sharing: arriving jobs build up behind a gate while waiting to begin service, while jobs in front of the gate are served
Externí odkaz:
http://arxiv.org/abs/2302.06796
The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random order, one at a time. Because the classically optimal solution is known
Externí odkaz:
http://arxiv.org/abs/2107.04872
Publikováno v:
In Discrete Mathematics January 2022 345(1)
Autor:
Kochalski, Katelynn D.
Publikováno v:
Notices of the American Mathematical Society; Nov2019, Vol. 66 Issue 10, p1655-1656, 2p