Sciweavers

11016 search results - page 2161 / 2204
» Cloud Computing for Science
Sort
View
MFPS
1989
14 years 22 days ago
Operations on Records
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
Luca Cardelli, John C. Mitchell
PODS
1989
ACM
129views Database» more  PODS 1989»
14 years 22 days ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 21 days ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
14 years 21 days ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ACMICEC
2007
ACM
148views ECommerce» more  ACMICEC 2007»
14 years 21 days ago
Pricing digital content with DRM mechanism
The Internet and file sharing technology (such as P2P network) significantly alleviate the content distribution cost. However, better digital content distribution also means that ...
Yung-Ming Li, Chia-Hao Lin
« Prev « First page 2161 / 2204 Last » Next »