2446 search results - page 168 / 490 » Choiceless Polynomial Time |
160
Voted
DAC
1997
ACM
15 years 10 months ago
1997
ACM
This paper presents for the first time low energy simultaneous memory and register allocation. A minimum cost network flow approach is used to efficiently solve for minimum energy...
173
click to vote
JSC
2010
15 years 5 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
189
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
178
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
184
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...