3600 search results - page 66 / 720 » The settling-time reducibility ordering |
RTA
1998
Springer
14 years 2 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
ASPDAC
2007
ACM
14 years 2 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
ICS
2000
Tsinghua U.
14 years 2 months ago
2000
Tsinghua U.
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
DBPL
1995
Springer
14 years 2 months ago
1995
Springer
We describe the Tycoon approach to scale the successful notion of a uniform, type-safe persistent object store to communication-intensive applications and applications where lo...
PLDI
1995
ACM
14 years 1 months ago
1995
ACM
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...