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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
