1941 search results - page 18 / 389 » On the Hardness of Approximate Reasoning |
71
Voted
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
IRI
2007
IEEE
15 years 3 months ago
2007
IEEE
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
ICLP
2001
Springer
15 years 2 months ago
2001
Springer
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
81
Voted
ICCBR
2007
Springer
15 years 3 months ago
2007
Springer
The aim of this paper is to analyze how the generalizations built by a CBR method can be used as local approximations of a concept. From this point of view, these local approximati...