1941 search results - page 200 / 389 » On the Hardness of Approximate Reasoning |
183
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
185
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
188
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
159
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
166
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...