Sciweavers

334 search results - page 5 / 67
» Capturing Web Services Provider Constraints - An Algorithmic...
Sort
View
JUCS
2010
141views more  JUCS 2010»
13 years 6 months ago
Trust-Oriented Composite Service Selection with QoS Constraints
Abstract: In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust...
Lei Li, Yan Wang, Ee-Peng Lim
SEMWEB
2007
Springer
14 years 1 months ago
Formulation of Hierarchical Task Network Service (De)composition
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
Seiji Koide, Hideaki Takeda
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
SEMWEB
2009
Springer
14 years 2 months ago
Exploiting User Feedback to Improve Semantic Web Service Discovery
State-of-the-art discovery of Semantic Web services is based on hybrid algorithms that combine semantic and syntactic matchmaking. These approaches are purely based on similarity m...
Anna Averbakh, Daniel Krause, Dimitrios Skoutas
WWW
2008
ACM
14 years 8 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