2009 IEEE Conference on Commerce and Enterprise Computing WSPR*: Web-Service Planner Augmented with A* Algorithm Vienna, Austria July 20-July 23 ISBN: 978-0-7695-3755-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CEC.2009.13
When there are a large number of web services in use, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to “compose” multiple web services to fulfill the goal. It is important to have a wise decision on underlying web-service composition framework because the search space for such a composition problem is in general exponentially increasing. Furthermore, if semantic and QoS issues are concerned, the composition problems become easily intractable. Toward this problem, in this paper, we present WSPR* - Web-Service PlanneR augmented with A* algorithm (a Label Correcting variation algorithm) to compose web services effectively.
Index Terms:
Web service composition
Citation:
Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-Min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, Sang-Do Noh, Mye M. Sohn, "WSPR*: Web-Service Planner Augmented with A* Algorithm," cec, pp.515-518, 2009 IEEE Conference on Commerce and Enterprise Computing, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||