Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
QoS driven dynamic binding in-the-many
QoSA'10 Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps
A web service composition algorithm based on global qos optimizing with MOCACO
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A comparative analysis of algorithms for dynamic web services composition with quality of service
Proceedings of the 19th Brazilian symposium on Multimedia and the web
Hi-index | 0.00 |
Web Service selection is an important issue in dynamic Web Service composition. The existing approaches are QoS local optimization based. They cannot achieve global constraints and preferences set by user. In general, service selection with QoS global optimization is a NP-complete problem. So, we propose a model of Web Service selection with QoS global optimization and convert this NP-complete problem into a multi-objective optimization problem with constraints. Based on intelligent optimal theory of multi-objective Genetic Algorithm, we propose a strategy GODSS to realize Web Service selection with QoS global optimization.