机构

• 数学与系统科学研究院 [8]
• 计算技术研究所 [2]
• 软件研究所 [2]
• 长春光学精密机械与物... [1]
• 中国科学院大学 [1]
• 沈阳自动化研究所 [1]
• 更多

采集方式

• OAI收割 [15]
• iSwitch采集 [1]

内容类型

• 期刊论文 [14]
• 会议论文 [1]
• 学位论文 [1]

发表日期

• 2020 [2]
• 2015 [1]
• 2011 [1]
• 2009 [4]
• 2006 [2]
• 2005 [1]
• 更多

学科主题

• Computer S... [1]
• 物理学::光学::非... [1]

筛选

浏览/检索结果: 共16条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Parameterized Dynamic Cluster Editing 期刊论文  OAI收割 ALGORITHMICA, 2020, 页码: 44 作者:  Luo, Junjie;  Molter, Hendrik;  Nichterlein, Andre;  Niedermeier, Rolf   |  收藏  |  浏览/下载：23/0  |  提交时间：2020/09/23 Graph-based data clustering  Incremental clustering  Compromise clustering  Correlation clustering  Local search  Goal-oriented clustering  NP-hard problems  Fixed-parameter tractability  Parameterized complexity  Kernelization  Multi-choice knapsack   压缩反馈相干伊辛机的理论研究 学位论文  OAI收割 北京: 中国科学院大学, 2020 作者:  罗李浩男   |  收藏  |  浏览/下载：204/0  |  提交时间：2020/06/23 相干伊辛机  NP-hard问题  简并光参量振荡器  最大割问题   考虑时延约束的无线传感器网络中继节点部署算法 期刊论文  OAI收割 中国科学:信息科学, 2015, 卷号: 45, 期号: 6, 页码: 766-782 作者:  马超凡;  郑萌;  梁炜 收藏  |  浏览/下载：33/0  |  提交时间：2015/08/28 无线传感器网络  时延约束  中继节点部署  最短路径树  NP-hard问题   Shortest path and maximum flow problems in networks with additive losses and gains 期刊论文  OAI收割 THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 4-5, 页码: 391-401 作者:  Brandenburg, Franz J.;  Cai, Mao-cheng   |  收藏  |  浏览/下载：16/0  |  提交时间：2018/07/30 Extended networks  Lossy and gainy arcs  Max-flow problems  Shortest path problems  NP-hard problems  Unit-loss networks   An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文  OAI收割 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China 作者:  Wang C. 收藏  |  浏览/下载：14/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.   近似骨架导向的归约聚类算法 期刊论文  OAI收割 电子与信息学报, 2009, 卷号: 31, 期号: 12, 页码: 2953-2957 宗瑜; 李明楚; 江贺 收藏  |  浏览/下载：22/0  |  提交时间：2011/03/18 聚类问题  NP-难解  启发式算法  近似骨架  Clustering issue  NP-hard  Heuristic algorithm  Approximate backbone  骨架导向  归约  聚类算法  optimal solutions  近似骨架  search space  局部最优解  clustering algorithm  Reduction Algorithm  聚类问题  high quality  算法收敛速度  数据集  研究成果  搜索空间  实验结果  聚类质量  基本思想  骨架特征  multipleCluster analysis  Computational complexity  Feature extraction  Heuristic algorithms  Heuristic methods  Optimal systems   A local-stem-search algorithm to predict the rna secondary structure 期刊论文  iSwitch采集 Progress in biochemistry and biophysics, 2009, 卷号: 36, 期号: 1, 页码: 115-121 作者:  Chen Xiang;  Bu Dong-Bo;  Zhang Fa;  Gao Wen 收藏  |  浏览/下载：31/0  |  提交时间：2019/05/10 Rna secondary structure prediction  Pseudoknot  Np-hard  Heuristic algorithm   A Local-stem-search Algorithm to Predict The RNA Secondary Structure 期刊论文  OAI收割 PROGRESS IN BIOCHEMISTRY AND BIOPHYSICS, 2009, 卷号: 36, 期号: 1, 页码: 115-121 作者:  Chen Xiang;  Bu Dong-Bo;  Zhang Fa;  Gao Wen   |  收藏  |  浏览/下载：16/0  |  提交时间：2019/12/16 RNA secondary structure prediction  pseudoknot  NP-hard  heuristic algorithm   Computation of arbitrage in frictional bond markets 期刊论文  OAI收割 THEORETICAL COMPUTER SCIENCE, 2006, 卷号: 363, 期号: 3, 页码: 248-256 作者:  Cai, Mao-cheng;  Deng, Xiaotie;  Li, Zhongfei   |  收藏  |  浏览/下载：16/0  |  提交时间：2018/07/30 frictional market  weak no-arbitrage  computational complexity  NP-hard   Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype 期刊论文  OAI收割 EVOLUTIONARY BIOINFORMATICS, 2006, 卷号: 2, 页码: 261-270 作者:  Zhang, Xiang-Sun;  Wang, Rui-Sheng;  Wu, Ling-Yun;  Zhang, Wei   |  收藏  |  浏览/下载：20/0  |  提交时间：2018/07/30 individual haplotyping  minimum conflict individual haplotyping  NP-hard  dynamic programming  feed-forward neural network  reconstruction rate