443 search results - page 53 / 89 » Relations in Concurrency |
INFOCOM
1993
IEEE
14 years 1 months ago
1993
IEEE
In [18], we propose a framework to study a stream of trafic or message as it is transferred over an ATM connection. A message is modeled as a deierministic fluid flow, and an ATM ...
VLDB
1990
ACM
14 years 27 days ago
1990
ACM
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
BIOWIRE
2007
Springer
14 years 26 days ago
2007
Springer
Chemical computing models have been proposed since the 1980ies for expressing concurrent computations in elegant ways for shared memory systems. In this paper we look at the distri...
ESWS
2007
Springer
14 years 23 days ago
2007
Springer
Machine-understandable data constitutes the foundation for the Semantic Web. This paper presents a viable way for authoring and annotating Semantic Documents on the desktop. In our...
ATVA
2006
Springer
14 years 19 days ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....