Sciweavers

11 search results - page 1 / 3
» An Efficient Syntactic Web Service Composition Algorithm Bas...
Sort
View
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
AAAI
2007
13 years 7 months ago
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
Zhen Liu, Anand Ranganathan, Anton Riabov
SAINT
2003
IEEE
13 years 10 months ago
Planning For Web Services the Hard Way
In this paper we outline a framework for performing automated discovery, composition and execution of web services based solely on the information available in interface descripti...
Mark James Carman, Luciano Serafini
ICWS
2004
IEEE
13 years 6 months ago
Dynamic Workflow Composition using Markov Decision Processes
The advent of Web services has made automated workflow composition relevant to Web based applications. One technique that has received some attention, for automatically composing ...
Prashant Doshi, Richard Goodwin, Rama Akkiraju, Ku...
WWW
2009
ACM
14 years 5 months ago
Automatic web service composition with abstraction and refinement
ion and Refinement Hyunyoung Kil Wonhong Nam Dongwon Lee The Pennsylvania State University, University Park, PA 16802, USA {hykil, wnam, dongwon}@psu.edu The behavioral descriptio...
Hyunyoung Kil, Wonhong Nam, Dongwon Lee