1941 search results - page 2 / 389 » On the Hardness of Approximate Reasoning |
WISE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
TSD
2005
Springer
13 years 10 months ago
2005
Springer
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
CSL
1987
Springer
13 years 8 months ago
1987
Springer
DLOG
2009
13 years 2 months ago
2009
AAAI
2010
13 years 6 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...