Sciweavers

552 search results - page 21 / 111
» Languages Modulo Normalization
Sort
View
ATVA
2007
Springer
226views Hardware» more  ATVA 2007»
15 years 8 months ago
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
David Walter, Scott Little, Chris J. Myers
IEEEHPCS
2010
15 years 21 hour ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
FLAIRS
2007
15 years 4 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
CIKM
2011
Springer
14 years 2 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai
DLT
2001
15 years 3 months ago
Context-Free Valence Grammars - Revisited
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
Hendrik Jan Hoogeboom