Makjamroen T.: The self-organizing list and processor problems under randomized policies. In: Acta cybernetica, (10) 4. pp. 283-302. (1992)
Preview |
Cikk, tanulmány, mű
cybernetica_010_numb_004_283-302.pdf Download (965kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1992 |
| Volume: | 10 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 283-302 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38495/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 301-302. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 09:56 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12513 |
Actions (login required)
 |
View Item |
