文献知网节
  • 记笔记
摘要:Due to the lack of solution with polynomial time complexity for minimum number of Web services required in Web service composition(WSC),an approximation algorithm based on WSPR(Web Service Planner)algorithm is proposed.Compared with the WSPR,the new algorithm can provide composition solutions with higher approximate degree with almost the same time cost.Then,the proposed improved approximation algorithm is further extended for the top-k service composition.The experiment results show that the proposed algorithm,compared with the IDA*algorithm,can give out solutions with high approximate degree with very small time cost(polynomial time complexity),which is more valuable in real time Web service application.
会议名称:

2015 World Conference on Control, Electronics and Electrical Engineering(WCEE 2015)

会议时间:

2015-01-17

会议地点:

中国上海

  • 专辑:

    信息科技

  • 专题:

    互联网技术

  • 分类号:

    TP393.09

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

下载:7 页码:951-958 页数:8 大小:196k

引文网络
  • 参考文献
  • 引证文献
  • 共引文献
  • 同被引文献
  • 二级参考文献
  • 二级引证文献
  • 批量下载
相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 相关法规
  • 关联作者
  • 相关视频