8141 search results - page 1538 / 1629 » Higher Order Generalization |
CTCS
1989
Springer
15 years 2 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...
VISUALIZATION
1992
IEEE
15 years 2 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
WDAG
1990
Springer
15 years 2 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
ACMACE
2007
ACM
15 years 2 months ago
2007
ACM
Computer games do not afford much physical activity and hence do not require significant energy expenditure, which can contribute to the prevalence of a sedentary lifestyle. A &qu...
116
click to vote
AOSD
2009
ACM
15 years 2 months ago
2009
ACM
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...