438 search results - page 4 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
132
Voted
ILP
2003
Springer
15 years 8 months ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
104
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
128
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
138
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
135
Voted
IOPADS
1997
15 years 4 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...