685 search results - page 31 / 137 » Closure Operators for Order Structures |
124
click to vote
WDAG
2004
Springer
15 years 7 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
113
Voted
CALCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
129
click to vote
MICRO
2009
IEEE
15 years 8 months ago
2009
IEEE
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
111
Voted
HPCA
2004
IEEE
16 years 2 months ago
2004
IEEE
Modern out-of-order processors tolerate long latency memory operations by supporting a large number of inflight instructions. This is particularly useful in numerical applications...
130
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Natively unfolded proteins lack a well defined three dimensional structure but have important biological functions, suggesting a re-assignment of the structure-functio...