1941 search results - page 52 / 389 » On the Hardness of Approximate Reasoning |
PVLDB
2008
14 years 11 months ago
2008
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
107
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract Web services choreography describes global models of service interactions among a set of participants. For an interaction to be executed, the participants taken part in it...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
IJMMS
1998
14 years 11 months ago
1998
: Decision-support systems that help solving problems in open and weak theory domains, i.e. hard problems, need improved methods to ground their models in real world situations. Mo...
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...