A generalized Abel's partial summation formula and its application in self-organizing systems

K. S. Chong; K. Lam

doi:10.1080/15326349908807562

A generalized Abel's partial summation formula and its application in self-organizing systems

K. S. Chong, K. Lam

Research output: Contribution to journal › Journal article › peer-review

2 Citations (Scopus)

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	https://doi.org/10.1080/15326349908807562
Publication status	Published - Jul 1999
Externally published	Yes

Scopus Subject Areas

Modelling and Simulation

User-Defined Keywords

Abel's partial summation formula
Comparison of search costs
Linear search
Markov chain models
Move-forward
POS(i) rules

Access to Document

10.1080/15326349908807562

Cite this

@article{a43b9b155e8f4395ba86424be07013d4,

title = "A generalized Abel's partial summation formula and its application in self-organizing systems",

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.",

keywords = "Abel's partial summation formula, Comparison of search costs, Linear search, Markov chain models, Move-forward, POS(i) rules",

author = "Chong, {K. S.} and K. Lam",

note = "Publisher copyright: {\textcopyright} 1999 by Marcel Dekker, Inc.",

year = "1999",

month = jul,

doi = "10.1080/15326349908807562",

language = "English",

volume = "15",

pages = "779--790",

journal = "Communications in Statistics. Stochastic Models",

issn = "0882-0287",

publisher = "Taylor and Francis",

number = "4",

}

TY - JOUR

T1 - A generalized Abel's partial summation formula and its application in self-organizing systems

AU - Chong, K. S.

AU - Lam, K.

PY - 1999/7

Y1 - 1999/7

N2 - 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.

AB - 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.

KW - Abel's partial summation formula

KW - Comparison of search costs

KW - Linear search

KW - Markov chain models

KW - Move-forward

KW - POS(i) rules

UR - http://www.scopus.com/inward/record.url?scp=0042761175&partnerID=8YFLogxK

U2 - 10.1080/15326349908807562

DO - 10.1080/15326349908807562

M3 - Journal article

AN - SCOPUS:0042761175

SN - 0882-0287

VL - 15

SP - 779

EP - 790

JO - Communications in Statistics. Stochastic Models

JF - Communications in Statistics. Stochastic Models

IS - 4

ER -

A generalized Abel's partial summation formula and its application in self-organizing systems

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Cite this