598 search results - page 51 / 120 » Note on parallel universes |
PODC
1994
ACM
15 years 1 months ago
1994
ACM
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
101
click to vote
ICPP
1992
IEEE
15 years 1 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
A lot of recent research on content-based P2P searching for file-sharing applications has focused on exploiting semantic relations between peers to facilitate searching. To the be...
ACISP
1999
Springer
15 years 2 months ago
1999
Springer
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...
101
click to vote
JLP
2008
14 years 9 months ago
2008
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...