Sciweavers

10447 search results - page 2048 / 2090
» The Philosophy of Computer Science
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 3 months 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 3 months 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 3 months 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
ASPLOS
2009
ACM
14 years 3 months ago
Accelerating phase unwrapping and affine transformations for optical quadrature microscopy using CUDA
Optical Quadrature Microscopy (OQM) is a process which uses phase data to capture information about the sample being studied. OQM is part of an imaging framework developed by the ...
Perhaad Mistry, Sherman Braganza, David R. Kaeli, ...
CASES
2007
ACM
14 years 3 months ago
Performance optimal processor throttling under thermal constraints
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...
Ravishankar Rao, Sarma B. K. Vrudhula
« Prev « First page 2048 / 2090 Last » Next »