1941 search results - page 30 / 389 » On the Hardness of Approximate Reasoning |
160
click to vote
AAAI
1997
15 years 7 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
170
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
180
click to vote
SOFTWARE
2002
15 years 5 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
183
click to vote
TVLSI
2010
15 years 25 days ago
2010
There is a dramatic logic density gap between FPGAs and ASICs, and this gap is the main reason FPGAs are not cost-effective in high volume applications. Modern FPGAs narrow this ga...
144
click to vote
OTM
2005
Springer
15 years 11 months ago
2005
Springer
Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...