National Taiwan Ocean University Institutional Repository:Item 987654321/27957
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2401545      Online Users : 65
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item:

Title: Optimal Service Selection for Composition Based on Weighted Service Flow and Genetic Algorithm
Authors: Shang-Pin Ma;Jong-Yih Kuo;Yong-Yi Fanjiang;Chin-Pin Tung Chun-Ying Huang
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: Basis Path Analysis;Genetic Algorithm;Quality of Service;Web Service Composition
Date: 2010
Issue Date: 2011-10-21T02:34:41Z
Publisher: International Conference on Machine Learning and Cybernetics (ICMLC), 2010
Abstract: Abstract:Optimization of service selection for composition is a critical but difficult issue in the area of service-oriented computing. This paper proposes an innovative approach to solve this issue. In the proposed approach, every abstract component service in the composition will be assigned a weight value to represent its importance through user assignment and execution path analysis, and then a weighted service flow will be generated. A service combination that includes selected concrete component services will be produced based on the weighted service flow and the Genetic Algorithm. The service combination will be of acceptable quality, and ensures the core component services that will most likely affect the whole service flow execution are more robust than other ones.
Relation: pp.3252-3256
Appears in Collections:[Department of Computer Science and Engineering] Lecture & Seminar

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback