3616 search results - page 73 / 724 » Conditional Memory Ordering |
125
click to vote
HIPC
1999
Springer
15 years 8 months ago
1999
Springer
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
147
click to vote
FROCOS
2000
Springer
15 years 8 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
139
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
135
click to vote
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
15 years 4 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
123
click to vote
HPCA
2009
IEEE
16 years 5 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...