Sciweavers

491 search results - page 9 / 99
» Linear Quantifier Elimination
Sort
View
FPL
2007
Springer
97views Hardware» more  FPL 2007»
13 years 11 months ago
An FPGA Approach to Quantifying Coherence Traffic Efficiency on Multiprocessor Systems
Recently, there is a surge of interests in using FPGAs for computer architecture research including applications from emulating and analyzing a new platform to accelerating microa...
Taeweon Suh, Shih-Lien Lu, Hsien-Hsin S. Lee
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
14 years 2 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
RTSS
2005
IEEE
14 years 1 months ago
Quantifying the Gap between Embedded Control Models and Time-Triggered Implementations
Mapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies...
Hakan Yazarel, Antoine Girard, George J. Pappas, R...
JSYML
2006
119views more  JSYML 2006»
13 years 7 months ago
0-D-valued fields
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
Nicolas Guzy
OOPSLA
2005
Springer
14 years 29 days ago
Quantifying the performance of garbage collection vs. explicit memory management
Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage col...
Matthew Hertz, Emery D. Berger