Sciweavers

1960 search results - page 158 / 392
» The Logic of Large Enough
Sort
View
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
14 years 1 months ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...
Huey-Yih Wang, Robert K. Brayton
FROCOS
2007
Springer
14 years 1 months ago
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
Roberto Sebastiani
ASAP
2004
IEEE
126views Hardware» more  ASAP 2004»
14 years 1 months ago
Hyper-Programmable Architectures for Adaptable Networked Systems
We explain how modern programmable logic devices have capabilities that are well suited for them to assume a central role in the implementation of networked systems, now and in th...
Gordon J. Brebner, Philip James-Roxby, Eric Keller...
ASPDAC
2006
ACM
121views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Efficient early stage resonance estimation techniques for C4 package
- In this paper, we study the relationship between C4 package resonance effects and logical switching timing correlations, which has not been thoroughly investigated in the past. W...
Jin Shi, Yici Cai, Sheldon X.-D. Tan, Xianlong Hon...
SEBD
2007
121views Database» more  SEBD 2007»
13 years 10 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...