中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks

文献类型:期刊论文

作者Liu, Boxiao1,3; Yuan, Mengting2; You, Haihang1
刊名FRONTIERS OF COMPUTER SCIENCE
出版日期2023-06-01
卷号17期号:3页码:3
ISSN号2095-2228
DOI10.1007/s11704-022-1781-6
资助项目National Natural Science Foundation of China[41930110] ; National Natural Science Foundation of China[61872272] ; National Natural Science Foundation of China[61640221]
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000850884700001
出版者HIGHER EDUCATION PRESS
源URL[http://119.78.100.204/handle/2XEOYT63/19444]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Yuan, Mengting; You, Haihang
作者单位1.Chinese Acad Sci, Inst Comp Technol, State Key Lab Proc, Beijing 100190, Peoples R China
2.Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China
3.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
推荐引用方式
GB/T 7714
Liu, Boxiao,Yuan, Mengting,You, Haihang. A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks[J]. FRONTIERS OF COMPUTER SCIENCE,2023,17(3):3.
APA Liu, Boxiao,Yuan, Mengting,&You, Haihang.(2023).A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks.FRONTIERS OF COMPUTER SCIENCE,17(3),3.
MLA Liu, Boxiao,et al."A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks".FRONTIERS OF COMPUTER SCIENCE 17.3(2023):3.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。