1941 search results - page 26 / 389 » On the Hardness of Approximate Reasoning |
ICCS
2001
Springer
15 years 4 months ago
2001
Springer
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
105
click to vote
IJCAI
1997
15 years 1 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
STOC
2009
ACM
16 years 11 days ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
ESWS
2010
Springer
15 years 4 months ago
2010
Springer
—We present an intelligent service matchmaker, called iSeM, for adaptive and hybrid semantic service selection that exploits the full semantic profile in terms of signature anno...