Abstract
In this paper, Abel's partial summation formula is generalized to a two-dimensional case. The result finds an application in comparing self-organizing algorithms. It is shown that, under all request probabilities, the expected equilibrium search cost for the POS(2) rule is not less than that for the POS(3) rule, both rules being self-organizing rules for arranging records in a linear list.
| Original language | English |
|---|---|
| Pages (from-to) | 779-790 |
| Number of pages | 12 |
| Journal | Communications in Statistics. Stochastic Models |
| Volume | 15 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Jul 1999 |
| Externally published | Yes |
User-Defined Keywords
- Abel's partial summation formula
- Comparison of search costs
- Linear search
- Markov chain models
- Move-forward
- POS(i) rules
Fingerprint
Dive into the research topics of 'A generalized Abel's partial summation formula and its application in self-organizing systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver