Sciweavers

79 search results - page 2 / 16
» Randomized Competitive Algorithms for Generalized Caching
Sort
View
SPAA
2004
ACM
13 years 10 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
13 years 4 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
13 years 10 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
EUSFLAT
2007
150views Fuzzy Logic» more  EUSFLAT 2007»
13 years 6 months ago
Competitive Self-adaptation in Evolutionary Algorithms
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
Josef Tvrdík, Ivan Krivý
STACS
2009
Springer
13 years 11 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...