文档介绍：小型微型计算机系统年月第期
Journal Chinese Systems V0134 .
Web
邓晓栋保跖粑一,丁志军
1(201804)
2(201804)
猰簒甦畉
Web
⒎
Web
Web
服务,并建立了他们之间的可达关系,最后根据用户期望的输出,结合前向搜索得到的服务及可达关系,通过后向搜索得到所有
的组合方案.
关键词:瘢籛服务组合;双向算法
TP3llA 10001220(2013)ll2437-04
Bidirectional Algorithm for Automated position
Xiaodon91WANG·”, Zhiqun2
錳 and Information EngineeringShanghai。
詉 Key ” and putingMinistry EducationShanghai.
AbstractDue their characteristics self-containmentself-descriptionandmodularizationWeb —
bom and position the hotspot and the potential
Web serviceHoweverthe Web servicestheheterogeneity service 瑃 dynamic changes Web service and
other factors determine the Web positionIn paperwepresent a polynomiallevelWeb posi
algorithm-Bidirectional algorithm which can all userS甌 the pretreatmentthe—
rithm firstly establishes the between the input and Web servicesForwardalgorithm finds out all the
Web might position and establishes the between Web
ording userS。 algorithm finds out all bining the Web —
and are got forward algorithm
Key 簑粀 positiontwowayalgorithm
1 引言 Web
模,尤其是效率方面,仍是一个急需要解决的问题.
Web(Web是基于 Web
Language)SOAP-
UDDI_71务组合问题,往往会有一组组合方案能够满足要求,而现有的
其自包含、自描述和模块化的特性,引起了工业界和学术界的服务自动组合算法多数只求解一条组合方案,不能给予用户
极大研究兴趣.
随着窦际醯娜涨鞒墒欤褡楹现鸾コ晌猈组合方案,
服