1515 search results - page 97 / 303 » Parallel computing on any desktop |
146
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
We study properties of asynchronous communication independently of any concrete concurrent process paradigm. We give a general-purpose, mathematically rigorous definition of sever...
140
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
145
click to vote
CCGRID
2004
IEEE
15 years 10 months ago
2004
IEEE
We investigate the circumstances under which it is possible to discourage free-riding in a peer-to-peer system for resource-sharing by prioritizing resource allocation to peers wi...
165
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
135
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
There is a large range of image processing applications that act on an input sequence of image frames that are continuously received. Throughput is a key performance measure to be ...