298 search results - page 8 / 60 » Competitive Analysis of Flash-Memory Algorithms |
IPPS
2009
IEEE
15 years 4 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...
ATVA
2011
Springer
13 years 9 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
DAM
1999
14 years 9 months ago
1999
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
103
click to vote
IOPADS
1997
14 years 11 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 ...
EUSFLAT
2003
14 years 11 months ago
2003
This paper suggests an evolutionary approach to design coordination strategies, a key issue in distributed intelligent systems. We focus on competitive strategies in the form of f...