Sciweavers

56 search results - page 4 / 12
» Context-based matching for Web service composition
Sort
View
ICWS
2008
IEEE
13 years 9 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
ECOWS
2006
Springer
13 years 11 months ago
Similarity Measurement about Ontology-based Semantic Web Services
Measurement of semantic similarity between Web services is an important factor for Web service discovery, composition, and even execution. Semantic Web services (SWS) are usually ...
Xia Wang, Yihong Ding, Yi Zhao
WWW
2004
ACM
14 years 8 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
EDOC
2004
IEEE
13 years 11 months ago
QoS Aggregation for Web Service Composition using Workflow Patterns
Contributions in the field of Web services have identified that (a) finding matches between semantic descriptions of advertised and requested services and (b) non-functional chara...
Michael C. Jaeger, Gregor Rojec-Goldmann, Gero M&u...
SOCO
2005
Springer
14 years 28 days ago
Composition-Oriented Service Discovery
Abstract. Service discovery and service aggregation are two crucial issues in the emerging area of Service-oriented Computing (SoC). We propose a new technique for the discovery of...
Antonio Brogi, Sara Corfini, Razvan Popescu