1941 search results - page 69 / 389 » On the Hardness of Approximate Reasoning |
100
click to vote
PROMISE
2010
14 years 6 months ago
2010
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
100
Voted
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
111
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
IJCAI
1997
15 years 1 months ago
1997
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...