11909 search results - page 2086 / 2382 » The Scheme Programming Language |
208
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
172
click to vote
ASPLOS
1996
ACM
15 years 10 months ago
1996
ACM
: One of the fundamental limits to high-performance, high-reliability file systems is memory's vulnerability to system crashes. Because memory is viewed as unsafe, systems per...
210
click to vote
ASPLOS
1996
ACM
15 years 10 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
184
click to vote
ASPLOS
1994
ACM
15 years 10 months ago
1994
ACM
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
207
click to vote
ICALP
1993
Springer
15 years 10 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...