Sciweavers

79 search results - page 14 / 16
» Splitting Logics
Sort
View
CADE
2004
Springer
14 years 12 days ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
MICRO
1998
IEEE
91views Hardware» more  MICRO 1998»
13 years 11 months ago
Effective Cluster Assignment for Modulo Scheduling
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
Erik Nystrom, Alexandre E. Eichenberger
DAC
2004
ACM
13 years 10 months ago
Communication-efficient hardware acceleration for fast functional simulation
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
Young-Il Kim, Woo-Seung Yang, Young-Su Kwon, Chong...
LPAR
2010
Springer
13 years 5 months ago
The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach
Abstract. The paper presents the methodology and the results of checking consistency of the knowledge base of CADIAG-2, a large-scale medical expert system. Such knowledge base con...
Pavel Klinov, Bijan Parsia, David Picado-Mui&ntild...
NCA
2007
IEEE
14 years 1 months ago
Towards IQ-Appliances: Quality-awareness in Information Virtualization
Our research addresses two important problems that arise in modern large-scale distributed systems: (1) the necessity to virtualize their data flows by applying actions such as ï...
Radhika Niranjan, Ada Gavrilovska, Karsten Schwan,...