01666nab a2200217 i 4500 acta12513 20220613095623.0 161015s1992 hu o 0|| eng d 0324-721X SZTE Egyetemi Kiadványok Repozitórium hun eng Makjamroen T. The self-organizing list and processor problems under randomized policies [elektronikus dokumentum] / Makjamroen T. 1992 283-302 Acta cybernetica 10 No. 4 We consider the self-organizing list problem in the case that only one item has a different request probability and show that transposition has a steady state cost stochastically smaller than any randomized policy that moves the requested item, found in position t, to position j with some probability dij, i > j. A random variable X is said to be stochastically smaller than another random variable Y, written X <„ Y if Pr{X > Jfc} < Pr{Y > k}, for any k. This is a stronger statement than E[X] < E[Y|. We also show that the steady state cost under the policy that moves the requested item i positions forward is stochastically increasing in t. Sufficient conditions are given for the steady state cost under a randomized policy A to be stochastically smaller than that under another randomized policy B. Similar results are obtained for the processor problem, where a list of processors is considered. Természettudományok Számítás- és információtudomány Számítástechnika, Kibernetika http://acta.bibl.u-szeged.hu/12513/1/cybernetica_010_numb_004_283-302.pdf Dokumentum-elérés