1 publication
-
Published Subscription
Off-Line List Accessing Algorithms with Circular Doubly Linked List and Partial Cost ModelBy Himansu Sekhar Behera, Rakesh Mohanty
Abstract: List Accessing Problem (LAP) has been an interesting and challenging research area for computer scientists since last four decades. Various algorithms have been developed to access the records by different researchers with an intention to minimize the cost of traversal. This paper describes two newly proposed algorithms, which are variants of FC and MTF for circular doubly linked list with the use of partial cost model. A theoretical as well …
Published in Current Trends in Information Technology · Vol. 1, Issue 1, 2011 Read article →