400 search results - page 34 / 80 » Lower Bounds Using Kolmogorov Complexity |
ANCS
2005
ACM
14 years 3 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
BC
1998
13 years 9 months ago
1998
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
DC
2010
13 years 4 months ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
ISCA
2003
IEEE
14 years 3 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...