1941 search results - page 113 / 389 » On the Hardness of Approximate Reasoning |
163
click to vote
TCS
2010
15 years 4 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
150
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. This paper studies a technique for mapping ALCI knowledge bases into ALC. Worst-case optimal tableau-based procedures for the satisfiability/consistency problem w.r.t. g...
205
click to vote
RWEB
2010
Springer
15 years 4 months ago
2010
Springer
Ontologies constitute formal models of some aspect of the world that may be used for drawing interesting logical conclusions even for large models. Software models capture relevant...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
163
click to vote
PLILP
1992
Springer
15 years 10 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...