Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657802 | Theoretical Computer Science | 2005 | 31 Pages |
Abstract
We also provide the first average case analysis of WFA. We prove that WFA has O(log(Î)) expected competitive ratio if the request costs are chosen randomly from an arbitrary non-increasing distribution with standard deviation Ï=Î(λmin).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Guido Schäfer, Naveen Sivadasan,