1322 search results - page 233 / 265 » Parameterized counting problems |
ICCD
2006
IEEE
14 years 6 months ago
2006
IEEE
— Caches, block memories, predictors, state tables, and other forms of on-chip memory are continuing to consume a greater portion of processor designs with each passing year. Mak...
APSEC
2006
IEEE
14 years 4 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...