| Article ID: | iaor20002960 |
| Country: | United States |
| Volume: | 15 |
| Issue: | 4 |
| Start Page Number: | 779 |
| End Page Number: | 790 |
| Publication Date: | Jan 1999 |
| Journal: | Communications in Statistics - Stochastic Models |
| Authors: | Chong K.S., Lam K. |
| Keywords: | artificial intelligence |
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.