Sciweavers

132 search results - page 1 / 27
» Scalable Web Service Composition with Partial Matches
Sort
View
ESWS
2007
Springer
13 years 11 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
WWW
2004
ACM
14 years 5 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
WEBI
2004
Springer
13 years 10 months ago
Type-Based Composition of Information Services in Large Scale Environments
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
ICWS
2004
IEEE
13 years 6 months ago
Large Scale, Type-Compatible 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
WWW
2008
ACM
14 years 5 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari