Sciweavers

132 search results - page 18 / 27
» Logic for Automated Mechanism Design - A Progress Report
Sort
View
DAC
2006
ACM
14 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 8 days ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
DAC
2008
ACM
14 years 7 months ago
Functional test selection based on unsupervised support vector analysis
Extensive software-based simulation continues to be the mainstream methodology for functional verification of designs. To optimize the use of limited simulation resources, coverag...
Onur Guzey, Li-C. Wang, Jeremy R. Levitt, Harry Fo...
JCDL
2003
ACM
112views Education» more  JCDL 2003»
13 years 12 months ago
Protein Association Discovery in Biomedical Literature
Protein association discovery can directly contribute toward developing protein pathways; hence it is a significant problem in bioinformatics. LUCAS (Library of User-Oriented Conc...
Yueyu Fu, Javed Mostafa, Kazuhiro Seki
AGP
2003
IEEE
14 years 17 hour ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...