CORC

在结果中检索

CORC

浏览/检索结果: 共7条，第1-7条 帮助

已选(0)清除 条数/页：   排序方式：
Robust point cloud registration based on both hard and soft assignments 期刊论文
Optics and Laser Technology, 2019, 卷号: 110, 页码: 202-208
作者:  Zhu, Jihua;  Jin, Congcong;  Jiang, Zutao;  Xu, Siyu;  Xu, Minmin
收藏  |  浏览/下载：28/0  |  提交时间：2019/11/19
Energy-aware task assignment for mobile cyber-enabled applications in heterogeneous cloud computing 期刊论文
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 卷号: 111, 页码: 126-135
作者:  Gai, Keke[1];  Qiu, Meikang[2];  Zhao, Hui[3]
收藏  |  浏览/下载：3/0  |  提交时间：2019/12/23
Energy-Aware Optimal Task Assignment for Mobile Heterogeneous Embedded Systems in Cloud Computing 会议论文
3rd IEEE International Conference on Cyber Security and Cloud Computing (IEEE CSCloud) / 2nd IEEE International Conference of Scalable and Smart Cloud (IEEE SSC), 2016-06-25
作者:  Gai, Keke[1];  Qiu, Meikang[2];  Zhao, Hui[3];  Liu, Meiqin[4]
收藏  |  浏览/下载：1/0  |  提交时间：2019/12/23
A hybrid swarm optimization algorithm for complex assignment problem 会议论文
Luoyang, China, September 4, 2010 - September 5, 2010
作者:  Liu, Zongli;  Cao, Jie;  Yuan, Zhanting
收藏  |  浏览/下载：1/0  |  提交时间：2020/11/15
An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文
2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China
Yang Q.; Zhang C.; Wang C.
收藏  |  浏览/下载：13/0  |  提交时间：2013/03/25
Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.  
Backbone analysis and algorithm design for the quadratic assignment problem 期刊论文
SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 卷号: 51, 页码: 476-488
作者:  Jiang He;  Zhang XianChao;  Chen GuoLiang;  Li MingChu
收藏  |  浏览/下载：3/0  |  提交时间：2019/12/27
Complexity of partial inverse assignment problem and partial inverse cut problem 期刊论文
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 卷号: 35, 期号: 1, 页码: 117-126
作者:  Yang, XG
收藏  |  浏览/下载：13/0  |  提交时间：2018/07/30

©版权所有 ©2017 CSpace - Powered by CSpace