4218 search results - page 793 / 844 » Complete sets of cooperations |
CTCS
1989
Springer
13 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
SWAT
1992
Springer
13 years 11 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
We propose a technique which leverages configurable data caches to address the problem of cache interference in multitasking embedded systems. Data caches are often necessary to p...
ECRTS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we study the soft real-time web cluster architecture needed to support e-commerce and related applications. Our testbed is based on an industry standard, which defin...