2022 search results - page 250 / 405 » Complexity of Non-Monotonic Logics |
159
click to vote
ATS
2000
IEEE
15 years 11 months ago
2000
IEEE
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
192
click to vote
FCCM
2000
IEEE
15 years 11 months ago
2000
IEEE
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
160
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
147
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
155
click to vote
HICSS
1998
IEEE
15 years 10 months ago
1998
IEEE
Because a hypermedia document is more complex than conventional text, it requires preparation with respect to two key aspects. First, the author begins to develop a "vision&q...