288 search results - page 55 / 58 » An algebraic generalization of Kripke structures |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
IFIP
2004
Springer
14 years 29 days ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
SC
2009
ACM
14 years 7 days ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...