546 search results - page 86 / 110 » Extended Null-Move Reductions |
FTP
1998
Springer
14 years 22 days ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
DAC
1997
ACM
14 years 21 days ago
1997
ACM
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
ICS
1997
Tsinghua U.
14 years 20 days ago
1997
Tsinghua U.
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
VLSID
1994
IEEE
14 years 18 days ago
1994
IEEE
: This paper describes techniques for energy efficient implementation of programmable computation. consumption in programmable computation can be substantiallvlowered with nolossin...
CIAC
2006
Springer
14 years 7 days ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...