Sciweavers

225 search results - page 18 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
ICS
2007
Tsinghua U.
14 years 3 months ago
Cooperative cache partitioning for chip multiprocessors
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...
Jichuan Chang, Gurindar S. Sohi
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CP
2006
Springer
14 years 23 days ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
14 years 3 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
JCC
2008
166views more  JCC 2008»
13 years 9 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng