1458 search results - page 137 / 292 » Monads for incremental computing |
117
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
124
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
147
Voted
AGP
1996
IEEE
15 years 7 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
113
Voted
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
paper is concerned with ways of specifying situations and evaluating them efficiently. The techniques described in this paper were developed as part of the HiPAC (High Performance...
158
click to vote
EDOC
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...