7943 search results - page 46 / 1589 » A calculus for costed computations |
91
Voted
TIT
1998
15 years 9 days ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
81
Voted
MICCAI
2005
Springer
16 years 1 months ago
2005
Springer
Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been propose...
129
Voted
FROCOS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
117
click to vote
IJCAI
2001
15 years 2 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
114
Voted
CORR
2004
Springer
15 years 15 days ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...