1941 search results - page 242 / 389 » On the Hardness of Approximate Reasoning |
181
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The configuration of Web services is particularly hard given the heterogeneous, unreliable and open nature of the Web. Furthermore, such composite Web services are likely...
153
click to vote
AAAI
2007
15 years 8 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
177
click to vote
AGI
2008
15 years 7 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
177
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
bstract, rather than through examples. I’d like to see the ability to demonstrate examples in concrete situations, have the system record them, and generalize them to yield a pro...
150
click to vote
SERVICES
2010
15 years 7 months ago
2010
Abstract--Exchanging structured business documents is inevitable for successful collaboration in electronic commerce. A prerequisite, for fostering the interoperability between bus...