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 |