1941 search results - page 22 / 389 » On the Hardness of Approximate Reasoning |
109
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
COCO
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
141
Voted
AIIA
1991
Springer
15 years 5 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
131
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...