Sciweavers

6167 search results - page 1069 / 1234
» Can Refinement be Automated
Sort
View
SEMWEB
2010
Springer
13 years 8 months ago
Preference-Based Web Service Composition: A Middle Ground between Execution and Search
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
Shirin Sohrabi, Sheila A. McIlraith
SOCIALCOM
2010
13 years 8 months ago
Secure Wireless Embedded Systems Via Component-based Design
This paper introduces the method secure-by-design as a way of constructing wireless embedded systems using component-based modeling frameworks. This facilitates design of secure a...
Theis Hjorth, Rune Torbensen
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 8 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
WEBI
2010
Springer
13 years 8 months ago
Boosting Biomedical Entity Extraction by Using Syntactic Patterns for Semantic Relation Discovery
Biomedical entity extraction from unstructured web documents is an important task that needs to be performed in order to discover knowledge in the veterinary medicine domain. In ge...
Svitlana Volkova, Doina Caragea, William H. Hsu, J...
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 8 months ago
Dimensions of Difficulty in Translating Natural Language into First-Order Logic
In this paper, we present a study of a large corpus of student logic exercises in which we explore the relationship between two distinct measures of difficulty: the proportion of s...
Dave Barker-Plummer, Richard Cox, Robert Dale
« Prev « First page 1069 / 1234 Last » Next »