5762 search results - page 619 / 1153 » R-tree: A Hardware Implementation |
201
click to vote
CAV
2009
Springer
15 years 11 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
185
click to vote
CAV
2010
Springer
15 years 11 months ago
2010
Springer
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
178
click to vote
ASYNC
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesi...
184
click to vote
ATVA
2004
Springer
15 years 11 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
189
click to vote
CARDIS
2006
Springer
15 years 11 months ago
2006
Springer
Most present symmetric encryption algorithms result from a tradeoff between implementation cost and resulting performances. In addition, they generally aim to be implemented effici...