79 search results - page 8 / 16 » Randomized Competitive Algorithms for Generalized Caching |
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
VLDB
2004
ACM
14 years 24 days ago
2004
ACM
As CPUs become more powerful with Moore’s law and memory latencies stay constant, the impact of the memory access performance bottleneck continues to grow on relational operator...