期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Fishery Web Service Composition Method Based on Ontology 被引量:1
1
作者 YU Qing-mei WANG Lan HUANG Dong-mei 《Journal of Integrative Agriculture》 SCIE CSCD 2012年第5期792-799,共8页
Various fishery information systems have been developed in different times and on different platforms. Wet) service application composition is crucial in the sharing and integration of fishery data and information. I... Various fishery information systems have been developed in different times and on different platforms. Wet) service application composition is crucial in the sharing and integration of fishery data and information. In the present paper, a heuristic web service composition method based on fishery ontology is presented, and the proposed web services are described. Ontology reasoning capability was applied to generate a service composition graph. The heuristic function was introduced to reduce the searching space. The experimental results show that the algorithm used considers the services semantic similarity and adiusts web service composition plan by dynamically relying on the empirical data. 展开更多
关键词 web services composition semantic similarity fishery ontology heuristic function
下载PDF
The analysis of the convergence of ant colony optimization algorithm
2
作者 ZHU Qingbao WANG Lingling 《Frontiers of Electrical and Electronic Engineering in China》 CSCD 2007年第3期268-272,共5页
The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which w... The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which will influence the improvement of this algorithm.Therefore,the convergence of this algorithm applied to the traveling salesman problem(TSP)was analyzed in detail.The conclusion that this algorithm will definitely converge to the optimal solution under the condition of 0<q_(0)<1 was proved true.In addition,the influence on its convergence caused by the properties of the closed path,heuristic functions,the pheromone and q_(0) was analyzed.Based on the above-mentioned,some conclusions about how to improve the speed of its convergence are obtained. 展开更多
关键词 ant colony optimization algorithm convergence analysis heuristic function TSP
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部