中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共5条,第1-5条 帮助

条数/页: 排序方式:
Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game 期刊论文  OAI收割
IEEE/CAA Journal of Automatica Sinica, 2023, 卷号: 10, 期号: 2, 页码: 512-523
作者:  
Jie Chen;  Kaiyi Luo;  Changbing Tang;  Zhao Zhang;  Xiang Li
  |  收藏  |  浏览/下载:35/0  |  提交时间:2023/01/16
A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem 期刊论文  OAI收割
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 卷号: 12, 期号: 3, 页码: 1307-1315
作者:  
Zhao, Kai;  Wang, Zhaocai;  Lu, Yunzhao;  Qin, Jiangfeng;  Tan, Jian
收藏  |  浏览/下载:27/0  |  提交时间:2016/04/20
Core Percolation on Complex Networks 期刊论文  OAI收割
PHYSICAL REVIEW LETTERS, 2012, 卷号: 109, 期号: 20, 页码: 205703
作者:  
Zhou, HJ
收藏  |  浏览/下载:35/0  |  提交时间:2014/04/25
Long-range frustration in T=0 first-step replica-symmetry-broken solutions of finite-connectivity spin glasses 期刊论文  OAI收割
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2007, 期号: 1, 页码: -
作者:  
Zhou, Jie;  Ma, Hui;  Zhou, Haijun;  Zhou, J , Chinese Acad Sci, Inst Theoret Phys, Beijing 100080, Peoples R China
  |  收藏  |  浏览/下载:17/0  |  提交时间:2012/08/02
computational complexity of counting problems on 3-regular planar graphs 期刊论文  OAI收割
THEORETICAL COMPUTER SCIENCE, 2007, 卷号: 384, 期号: 1, 页码: 111-125
Xia Mingji; Zhang Peng; Zhao Wenbo
  |  收藏  |  浏览/下载:15/0  |  提交时间:2011/07/01