Abstract
QoS model of composite services and Web services selection based on QoS are currently the hot issues in the web service composition area. Services selection based on QoS, which is a global optimal selection issue, has been proved a NP-HARD problem. Takes engine into account, this paper builds the QoS model of service selection in the Web composite services, uses the estimation of distribution algorithm to solve the NP-HARD problem of services selection, and presents a Web services selection method based on the UMDA. Example analysis and experimental analysis based on the UMDA method are performed; it's proved that the method is effective in solving the NP-HARD problem of Web services selection. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Cheng, S., Lu, X., & Zhou, X. (2012). Global optimal selection of web composite services based on UMDA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7667 LNCS, pp. 237–246). https://doi.org/10.1007/978-3-642-34500-5_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
