Sciweavers

79 search results - page 5 / 16
» Randomized Competitive Algorithms for Generalized Caching
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
ISAAC
1999
Springer
70views Algorithms» more  ISAAC 1999»
13 years 11 months ago
Multiple Spin-Block Decisions
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
Peter Damaschke
EOR
2006
118views more  EOR 2006»
13 years 7 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
MICRO
2006
IEEE
162views Hardware» more  MICRO 2006»
14 years 1 months ago
Adaptive Caches: Effective Shaping of Cache Behavior to Workloads
We present and evaluate the idea of adaptive processor cache management. Specifically, we describe a novel and general scheme by which we can combine any two cache management alg...
Ranjith Subramanian, Yannis Smaragdakis, Gabriel H...