1450 search results - page 170 / 290 » On the Complexity of Hardness Amplification |
151
click to vote
AAAI
2008
15 years 8 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
125
click to vote
AAAI
2008
15 years 8 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
180
click to vote
AAAI
2007
15 years 8 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
203
click to vote
DLOG
2007
15 years 8 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
164
click to vote
FAST
2008
15 years 8 months ago
2008
The reliability of file systems depends in part on how well they propagate errors. We develop a static analysis technique, EDP, that analyzes how file systems and storage device d...