"The network will foster newrelationship between US andChinese small and medium-size companies in 14 key busi-ness centers, generating newopportunities for US SMEs inthe China market and prosper-ity for both our ..."The network will foster newrelationship between US andChinese small and medium-size companies in 14 key busi-ness centers, generating newopportunities for US SMEs inthe China market and prosper-ity for both our great nations,"said Tim Hauser.展开更多
In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. T...In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. The algorithm uses the proposed business relation model to minimize the searching space and uses the proposed goal distance as a heuristic rule. Compared with other algorithms tackling web service composition such as AI planning, the proposed algorithm focuses not only on how to convert the web service composition problem to the AI planning problem, but also exerts its effort on how to apply the business feature of web service composition into planning in order to improve the effectiveness. The experiment shows the better performance of the proposed algorithm.展开更多
文摘"The network will foster newrelationship between US andChinese small and medium-size companies in 14 key busi-ness centers, generating newopportunities for US SMEs inthe China market and prosper-ity for both our great nations,"said Tim Hauser.
基金The National Key Technologies R & D Program of China during the 10th Five-Year Plan Period(No2004BA721A05)
文摘In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. The algorithm uses the proposed business relation model to minimize the searching space and uses the proposed goal distance as a heuristic rule. Compared with other algorithms tackling web service composition such as AI planning, the proposed algorithm focuses not only on how to convert the web service composition problem to the AI planning problem, but also exerts its effort on how to apply the business feature of web service composition into planning in order to improve the effectiveness. The experiment shows the better performance of the proposed algorithm.
