2446 search results - page 119 / 490 » Choiceless Polynomial Time |
110
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A smoothing finite impulse response (FIR) filter is addressed for discrete time-invariant state-space polynomial models commonly used to model signals over finite data. A gener...
143
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
128
click to vote
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
138
click to vote
MOR
2000
15 years 3 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...