1941 search results - page 156 / 389 » On the Hardness of Approximate Reasoning |
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
270
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
139
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
181
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
178
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...