您当前的位置:
首页 >
文章列表页 >
Solving Scheduling Problem of Cloud Computing by Discrete PSO with Simulate Anneal Algorithm
更新时间:2026-09-04
    • Solving Scheduling Problem of Cloud Computing by Discrete PSO with Simulate Anneal Algorithm

    • Vol. 30, Issue 5, Pages: 137-140(2013)
    • Published:2013

    移动端阅览

  • ZHAO Xuan, WEI Cheng-jian, WANG Kai, et al. Solving Scheduling Problem of Cloud Computing by Discrete PSO with Simulate Anneal Algorithm[J]. 2013, 30(5): 137-140. DOI:

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

0

Views

9

下载量

0

CSCD

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

Related Articles

Design of ultra-low power real-time clock circuits
Lightweight countermeasures against Spectre attacks on the branch prediction unit
A feature-oriented context understanding and slice analysis network for tuberculosis detection
Research on the design of blockchain-based AI-generated content traceability framework
Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture

Related Author

No data

Related Institution

No data
0