1278 search results - page 141 / 256 » The Complexity of Weighted Boolean |
DATE
1999
IEEE
14 years 2 months ago
1999
IEEE
Complex signal processing algorithms are specified in floating point precision. When their hardware implementation requires fixed point precision, type refinement is needed. The p...
ISPD
1999
ACM
14 years 2 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
ASPDAC
1998
ACM
14 years 2 months ago
1998
ACM
−This paper describes a new redundant fault identification algorithm with Exclusive-OR circuit reduction. The experimental results using this algorithm with a FAN-based test patt...
INFORMATICALT
2006
13 years 10 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...