3368 search results - page 78 / 674 » The Complexity of Query Reliability |
RR
2010
Springer
13 years 7 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Robots that can interact naturally with humans require the integration and coordination of many different components with heavy computational demands. We argue that an architec...
DCC
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...