您当前的位置:
首页 >
文章列表页 >
An Extended Graph-Planning Based Top-K Service Composition Method
更新时间:2025-07-08
    • An Extended Graph-Planning Based Top-K Service Composition Method

    • Acta Electronica Sinica   Vol. 40, Issue 7, Pages: 1404-1409(2012)
    • DOI:10.3969/j.issn.0372-2112.2012.07.019    

      CLC: TP393
    • Published:2012

    移动端阅览

  • An Extended Graph-Planning Based Top-K Service Composition Method[J]. Acta Electronica Sinica, 2012, 40(7): 1404-1409. DOI: 10.3969/j.issn.0372-2112.2012.07.019.

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1510

下载量

6

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Dynamic Description Logic Based Web Service Composition and QoS Model
Trust-Based Decentralized Service Composition Approach in Service-Oriented Mobile Social Networks
Top-k Shortest-Path Query on RDF Graphs
Modeling the Web Service Behavior Semantically Based on the Ontology

Related Author

SHI Zhong-zhi
WANG Wen-jie
NIU Wen-jia
HAN Xu
WAN Chang-lin
任兴田
方 娟
侯亚荣

Related Institution

Graduate University of CASBeijing 100049China
Key Laboratory of IIPICTCASBeijing 100190China
Graduate University of CAS
Key Laboratory of IIP,ICT,CAS
School of Computer Science,Communication University of China
0