Sciweavers

90 search results - page 1 / 18
» Efficient Web Service Composition Based on Syntactical Match...
Sort
View
EEE
2005
IEEE
13 years 10 months ago
Efficient Web Service Composition Based on Syntactical Matching
Sheng Huang, Xiaoling Wang, Aoying Zhou
ICWS
2008
IEEE
13 years 6 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
WECWIS
2007
IEEE
143views ECommerce» more  WECWIS 2007»
13 years 11 months ago
Semantic Web-Service Discovery and Composition Using Flexible Parameter Matching
When there are a large number of web services available and no single service satisfies the given request, one has to compose multiple web services to fulfill the goal, considerin...
Seog-Chan Oh, Jung-Woon Yoo, Hyunyoung Kil, Dongwo...
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
ADC
2003
Springer
139views Database» more  ADC 2003»
13 years 10 months ago
Web Service Composition with Case-Based Reasoning
To run a smart E-Business or provide efficient Web service, a web services composition model is needed. Web services composition refers to the process of collaborating the heterog...
Benchaphon Limthanmaphon, Yanchun Zhang