903 search results - page 149 / 181 » Completeness Results for Memory Logics |
163
click to vote
VLSID
2005
IEEE
16 years 6 months ago
2005
IEEE
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
176
click to vote
GLVLSI
2009
IEEE
16 years 29 days ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
184
click to vote
ASAP
2008
IEEE
16 years 20 days ago
2008
IEEE
Process technology has reduced in size such that it is possible to implement complete applicationspecific architectures as Systems-on-Chip (SoCs) using both Application-Specific I...
141
click to vote
IROS
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...
170
click to vote
ESWS
2005
Springer
15 years 11 months ago
2005
Springer
The paper addresses the problem of reasoning with multiple ontologies interrelated with semantic mappings. This problem is becoming more and more relevant due to the necessity of b...