Sciweavers

1941 search results - page 242 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ECAI
2004
Springer
15 years 10 months ago
Configuration of Web Services as Parametric Design
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...
Annette ten Teije, Frank van Harmelen, Bob J. Wiel...
AAAI
2007
15 years 8 months ago
Best-First Search for Treewidth
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...
P. Alex Dow, Richard E. Korf
AGI
2008
15 years 7 months ago
Probabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
: 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...
Matthew Iklé, Ben Goertzel
DAGSTUHL
2007
15 years 7 months ago
End-User Software Engineering Position Paper
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...
Henry Lieberman
SERVICES
2010
128views more  SERVICES 2010»
15 years 7 months ago
Size Matters!? Measuring the Complexity of XML Schema Mapping Models
Abstract--Exchanging structured business documents is inevitable for successful collaboration in electronic commerce. A prerequisite, for fostering the interoperability between bus...
Christian Pichler, Michael Strommer, Christian Hue...