1094 search results - page 159 / 219 » On Computing Explanations in Argumentation |
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
COMGEO
2011
ACM
13 years 1 months ago
2011
ACM
ABSTRACT . Categories and Subject Descriptors K. Computing Milieux K.m MISCELLANEOUS General Terms Theory Keywords Cyber-physics, Internet of Things, Quantum computing Cloud Comput...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
ACMDIS
2004
ACM
14 years 3 months ago
2004
ACM
We elaborate a proposal for capturing, extending, and reusing design knowledge gleaned through usability testing. The proposal is specifically targeted to address interface design...