2657 search results - page 480 / 532 » On the complexity of hierarchical problem solving |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
WIDM
2003
ACM
14 years 2 months ago
2003
ACM
At the present time, several shortcomings prevent the more effective use and more intense application of web information systems. Recent developments that are subsumed by the term...
PODS
2010
ACM
14 years 2 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
ASPDAC
2008
ACM
13 years 11 months ago
2008
ACM
ACT Benchmarks are an immensely useful tool in performing research since they allow for rapid and clear comparison between different approaches to solving CAD problems. Recent expe...
TIP
2011
13 years 4 months ago
2011
We propose a prediction technique that is geared toward forming successful estimates of a signal based on a correlated anchor signal that is contaminated with complex interference...