Sciweavers

2621 search results - page 40 / 525
» Near orders and codes
Sort
View
ICCD
2000
IEEE
93views Hardware» more  ICCD 2000»
14 years 5 months ago
Cheap Out-of-Order Execution Using Delayed Issue
In superscalar architectures, out-of-order issue mechanisms increase performance by dynamically rescheduling instructions that cannot be statically reordered by the compiler. Whil...
J. P. Grossman
JSC
2007
130views more  JSC 2007»
13 years 8 months ago
The Moufang loops of order 64 and 81
We classify Moufang loops of order 64 and 81 up to isomorphism, using a linear algebraic approach to central loop extensions. In addition to the 267 groups of order 64, there are ...
Gábor P. Nagy, Petr Vojtechovský
EUROCRYPT
1991
Springer
14 years 1 days ago
Boolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
Bart Preneel, René Govaerts, Joos Vandewall...
TLCA
2009
Springer
14 years 3 months ago
Session-Based Communication Optimisation for Higher-Order Mobile Processes
In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our syst...
Dimitris Mostrous, Nobuko Yoshida
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 6 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney