1094 search results - page 106 / 219 » On Computing Explanations in Argumentation |
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
We consider two flow control schemes for Best Effort traffic in on-chip architectures, which can be deemed as the solutions to the boundary extremes of a class of utility maximi...
HASKELL
2006
ACM
15 years 5 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
ARITH
2005
IEEE
15 years 4 months ago
2005
IEEE
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
DSN
2005
IEEE
15 years 4 months ago
2005
IEEE
System call monitoring is a technique for detecting and controlling compromised applications by checking at runtime that each system call conforms to a policy that specifies the ...
MFCS
1995
Springer
15 years 2 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...