522 search results - page 18 / 105 » On the Hardness of the Noncommutative Determinant |
121
Voted
SUTC
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose ...
126
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
135
Voted
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
130
Voted
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
120
click to vote
MICRO
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...