Sciweavers

20441 search results - page 4031 / 4089
» Locally Computable Structures
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
POPL
1989
ACM
13 years 11 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
WMRD
1990
13 years 11 months ago
Replication in Ficus Distributed File Systems
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...
Gerald J. Popek, Richard G. Guy, Thomas W. Page Jr...
ACMICEC
2007
ACM
148views ECommerce» more  ACMICEC 2007»
13 years 11 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
ICDT
2010
ACM
180views Database» more  ICDT 2010»
13 years 11 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
« Prev « First page 4031 / 4089 Last » Next »