A Transposition Rule Analysis Based on a Particle Process

Details A Transposition Rule Analysis Based on a Particle Process A Transposition Rule Analysis Based on a Particle Process

2004-04-02

arxiv.org/abs/math/0404021v2

Mathematics

Probability

11 pages, 2 figures

Scientific paper

A linear list is a collection of items that can be accessed sequentially. The cost of a request is the number of items that need to be examined before the desired item is located, i.e., the distance of the requested item from the beginning of the list. The transposition rule is one of the algorithms designed to reduce the search cost by organizing the list. In particular, upon a request for a given item, the item is transposed with the preceding one. We develop a new approach for analyzing the algorithm. The approach is based on a coupling with a certain constrained asymmetric exclusion process. This allows us to establish an asymptotic optimality of the rule for two families of request distributions.

Affiliated with

Also associated with

No associations

Rating

A Transposition Rule Analysis Based on a Particle Process does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Transposition Rule Analysis Based on a Particle Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Transposition Rule Analysis Based on a Particle Process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145279