560 search results - page 4 / 112 » Global Computing in a Dynamic Network of Tuple Spaces |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
CP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
COORDINATION
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents O’KLAIM (Object-Oriented KLAIM), a linguistic extension of the higher-order calculus for mobile processes KLAIM with objectoriented features. Processes intera...
COORDINATION
2004
Springer
14 years 1 months ago
2004
Springer
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
SI3D
2009
ACM
14 years 3 months ago
2009
ACM
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...