Abstract
As the emergence of more and more web services, it becomes more difficult to find the candidate atomic services and composing them to form a matched service process, where not only time is strictly limited, but also user demand must be satisfied. In order to solve this problem, this paper presents a service process selection method, which is driven by historical successful service request/matching solutions. Firstly, the system framework model is analysed and several concepts about service selection and composition are formalised. Then, the method model and algorithm are detailed. Finally, through a set of experiments, the effectiveness and robustness of our approach are evaluated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Services Technology and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
