2446 search results - page 200 / 490 » Choiceless Polynomial Time |
ICCAD
1999
IEEE
14 years 18 days ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
ICCAD
1999
IEEE
14 years 18 days ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
CIKM
1999
Springer
14 years 18 days ago
1999
Springer
A semantic caching scheme suitable for wrappers wrapping web sources is presented. Since the web sources have typically weaker querying capabilities than conventional databases, e...
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
EMNLP
2009
13 years 6 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...