Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Competitiveness <strong>of</strong> Randomized <strong>Algorithms</strong><br />
Given a randomized online paging algorithm R and a<br />
sequence <strong>of</strong> requests generated by an adaptive <strong>of</strong>fline<br />
adversary<br />
• Let the number <strong>of</strong> misses by R be denoted by the<br />
random variable f R ()<br />
• Let the number <strong>of</strong> misses by the optimal online<br />
algorithm be denoted by the random variable<br />
f OPTON (R)<br />
• Then R is C-competitive against the adaptive <strong>of</strong>fline<br />
adversary if for every sequence <strong>of</strong> requests<br />
• E[f R ()] – C * E[f OPTON ()]
Change language