14699 search results - page 423 / 2940 » Complexity and Cognitive Computing |
186
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
147
click to vote
AAAI
1994
15 years 7 months ago
1994
This paper presents a novel approach to diagnosis which addresses the two problems - computational complexity of abduction and device models - that have prevented model-based diag...
132
click to vote
IJCAI
1993
15 years 7 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
170
click to vote
IJCAI
1989
15 years 7 months ago
1989
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
161
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...