2877 search results - page 474 / 576 » The Complexity of Planarity Testing |
130
click to vote
ASYNC
2000
IEEE
15 years 8 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
118
click to vote
SMA
1999
ACM
15 years 8 months ago
1999
ACM
Accurate prediction of the swept volume of a cutting tool is essential in NC verification algorithms for detecting deficiencies in a proposed tool path, such as gouging, undercutt...
139
click to vote
VLSID
1998
IEEE
15 years 8 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
134
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
145
click to vote
AMOST
2007
ACM
15 years 7 months ago
2007
ACM
Model-checkers have recently been suggested for automated software test-case generation. Several works have presented methods that create efficient test-suites using model-checker...