3600 search results - page 171 / 720 » The settling-time reducibility ordering |
167
click to vote
AAECC
1999
Springer
15 years 6 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
124
click to vote
SIGMOBILE
2002
15 years 6 months ago
2002
ese two applications are built upon the abstraction provided by the Context Service and thus help validate the design of this service. The first application, a Notification Dispatc...
193
click to vote
PATMOS
2010
Springer
15 years 4 months ago
2010
Springer
In most modern processor designs the L1 data cache has become a major consumer of power due to its increasing size and high frequency access rate. In order to reduce this power con...
150
click to vote
CISC
2009
Springer
15 years 4 months ago
2009
Springer
In [10], Buchmann, Pyshkin and Weinmann have described two families of Feistel and SPN block ciphers called Flurry and Curry respectively. These two families of ciphers are fully p...
177
click to vote
CCE
2010
15 years 3 months ago
2010
AbstrAct A comprehensive overview of numerical methodologies currently available for analyzing and building understanding of complex processes is presented. Both equation-free and ...