首页    期刊浏览 2024年11月29日 星期五
登录注册

文章基本信息

  • 标题:Optimizing Service Selection in Combinatorial Auction by Resolving Non-Linear Programming Constraints
  • 本地全文:下载
  • 作者:K. Uma Devi ; B. Lalitha
  • 期刊名称:International Journal of Soft Computing & Engineering
  • 电子版ISSN:2231-2307
  • 出版年度:2015
  • 卷号:5
  • 期号:4
  • 页码:36-39
  • 出版社:International Journal of Soft Computing & Engineering
  • 摘要:The selection of services with the aim to fulfill the quality constraints became critical and challenging research aspect in the field of service computing to promote automated service selection in service-based systems (SBSs), especially when the quality constraints are stringent. However, none of the existing approaches for quality-aware service composition has sufficiently considered QoS parameters to determine the best service. This paper proposes an optimization model for SBS to automate the process of quality aware service selection. Furthermore, this paper presents a compositional quality model to analyze and optimize the quality constraints that play a vital role in Winner Determination Problem (WDP).
  • 关键词:critical and challenging research aspect; computing to;promote automated service selection; QoS parameters;optimization model for SBS; Winner Determination Problem;(WDP).
国家哲学社会科学文献中心版权所有