1941 search results - page 106 / 389 » On the Hardness of Approximate Reasoning |
119
click to vote
CCCG
2010
15 years 7 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
221
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
176
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed ...
138
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...