An algorithm for best selection in semantic composition of Web service

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The automation of Web services interoperation can bring advantages to effective B2B collaboration. However, the techniques for Web service composition may still require a lot of manual efforts. For example, how to select the most appropriate service for service composition is far from trivial. This paper proposes a method for best selection which can perform the most appropriate selection in composition process. Given a selection policy such as minimum cost, the method can find the most appropriate service. Experiments show that the method proposed sometimes only takes a little more time than that without selection policy to select the best composition plan. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Cui, J., Zhu, Y., Gu, N., Zong, Y., Ding, Z., Zhang, S., & Zhang, Q. (2005). An algorithm for best selection in semantic composition of Web service. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 816–821). https://doi.org/10.1007/11563952_86

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free