The self-organizing list and processor problems under randomized policies
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 probabilit...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1992
|
| Sorozat: | Acta cybernetica
10 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12513 |
| LEADER | 01666nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12513 | ||
| 005 | 20220613095623.0 | ||
| 008 | 161015s1992 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Makjamroen T. | |
| 245 | 1 | 4 | |a The self-organizing list and processor problems under randomized policies |h [elektronikus dokumentum] / |c Makjamroen T. |
| 260 | |c 1992 | ||
| 300 | |a 283-302 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 4 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12513/1/cybernetica_010_numb_004_283-302.pdf |z Dokumentum-elérés |