✦ LIBER ✦

On the relative dominance of paging algorithms

✍ Scribed by Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro

Book ID: 108281547
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 711 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.04.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Influence of Lookahead in Competi

On the Influence of Lookahead in Competitive Paging Algorithms

✍ Albers, S. 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 203 KB

On the Algorithmic Complexity of Total D

On the Algorithmic Complexity of Total Domination

✍ Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T. 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 629 KB

On the algorithmic complexity of -tuple

On the algorithmic complexity of -tuple total domination

✍ Lan, James K.; Chang, Gerard Jennhwa 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 482 KB

On the algorithmic complexity of edge to

On the algorithmic complexity of edge total domination

✍ Zhao, Yancai; Liao, Zuhua; Miao, Lianying 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 345 KB

On the accuracy of the parallel diagonal

On the accuracy of the parallel diagonal dominant algorithm

✍ Hong Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Zhang, H. On the accuracy of the Parallel Diagonal Dominant Algorithm, Parallel Computing 17 (1991) ## 265-272 The Parallel Diagonal Dominant (PDD) Algorithm has been proposed for solving certain types of tridiagonal linear systems. The algorithm uses a matrix approximation. Both theoretical and

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB