#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2010

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Rakesh Mohanty, Sasmita Tripathy
- ArXiv
- 2011

AbstractFor the List Accessing Problem, Move-To-Front (MTF) algorithm has been proved to be the best performing online list accessing algorithm till date in the literature[10]. In this paper, we have made a comprehensive analysis of MTF algorithm and developed an Improved-MTF (IMTF) offline algorithm. We have generated two new types of data set and devise a… (More)

- Rakesh Mohanty, Burle Sharma, Sasmita Tripathy
- ArXiv
- 2011

List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a request… (More)

- Rakesh Mohanty, H.S. Behera, +4 authors S. Sourav
- 2010 International Conference on Methods and…
- 2010

For the list accessing problem, the standard cost model developed by Sleator and Tarjan[5] is most widely used for cost computation. In this paper, we have proposed a new effective cost model for the list accessing problem which uses doubly linked list as the data structure. We have proposed three new variants of MTF, TRANSPOSE and FC algorithms using our… (More)

- Rakesh Mohanty, Seetaya Bhoi, Sasmita Tripathy
- ArXiv
- 2011

There are many existing well known cost models for the list accessing problem. The standard cost model developed by Sleator and Tarjan is most widely used. In this paper, we have made a comprehensive study of the existing cost models and proposed a new cost model for the list accessing problem. In our proposed cost model, for calculating the processing cost… (More)

- ‹
- 1
- ›