{"title":"Composition Context for Web Services Selection","authors":"H. Yu, S. Reiff-Marganiec, M. Tilly","doi":"10.1109/ICWS.2008.98","DOIUrl":null,"url":null,"abstract":"Often there are several services providing similar functionality, moving the problem of selecting the most suitable to the forefront of interest. In this paper we consider the selection of services in a dynamic environment with changing requirements. In previous work we considered selecting services in isolation, here we present an enhancement to select services in their relation to each other to gain a global optimal solution which nevertheless respects local criteria. Novel contributions are the definition of a composition context and the global multi-criteria optimization mechanism.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"119 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2008.98","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Often there are several services providing similar functionality, moving the problem of selecting the most suitable to the forefront of interest. In this paper we consider the selection of services in a dynamic environment with changing requirements. In previous work we considered selecting services in isolation, here we present an enhancement to select services in their relation to each other to gain a global optimal solution which nevertheless respects local criteria. Novel contributions are the definition of a composition context and the global multi-criteria optimization mechanism.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
