机构

• 遥感与数字地球研究所 [4]
• 软件研究所 [4]
• 数学与系统科学研究院 [2]
• 长春光学精密机械与物... [1]
• 武汉物理与数学研究所 [1]
• 重庆绿色智能技术研究... [1]
• 更多

采集方式

• OAI收割 [13]

内容类型

• 期刊论文 [12]
• 会议论文 [1]

发表日期

• 2020 [1]
• 2015 [4]
• 2009 [1]
• 2008 [1]
• 2007 [1]
• 2006 [1]
• 更多

学科主题

• Computer S... [1]

筛选

浏览/检索结果: 共13条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序作者升序作者降序 一种布尔公式的代数逻辑约化新方法 期刊论文  OAI收割 计算机科学, 2020, 卷号: 47, 期号: 5, 页码: 32 作者:  刘江;  周鸿昊   |  收藏  |  浏览/下载：29/0  |  提交时间：2020/08/24 NP complete problem  Boolean satisfiability problem  1-in-3-SAT  XCNF  X pure literal  NP完全问题  布尔可满足性问题  1-in-3-SAT  XCNF  X-纯文字   A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing 期刊论文  OAI收割 INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES, 2015, 卷号: 16, 期号: 10, 页码: 882-893 作者:  Wang, Zhaocai;  Pu, Jun;  Cao, Liling;  Tan, Jian 收藏  |  浏览/下载：26/0  |  提交时间：2016/04/20 DNA molecules computing  the unbalanced assignment problem  biological optimization algorithm  NP-complete problem   A parallel algorithm for solving the n-queens problem based on inspired computational model 期刊论文  OAI收割 BIOSYSTEMS, 2015, 卷号: 131, 页码: 755-769 作者:  Wang, Zhaocai;  Huang, Dongmei;  Tan, Jian;  Liu, Taigang;  Zhao, Kai 收藏  |  浏览/下载：28/0  |  提交时间：2016/04/20 DNA computation  The n-queens problem  Adleman-Lipton model  NP-complete problem   Solving the Minimum Kernel Set Problem Based on Biologically DNA Molecular Computing 期刊论文  OAI收割 JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 卷号: 12, 期号: 9 作者:  Liu, Linan;  Zhao, Xiaomeng;  Li, Dongmei;  Yin, Xinghui;  Tan, Jian 收藏  |  浏览/下载：37/0  |  提交时间：2016/04/20 DNA Molecular Computing  The Minimum Kernel Set Problem  NP-Complete Problem   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 DNA Computation  The k-Vertex Cover Problem  Adleman-Lipton Model  NP-Complete Problem   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. 收藏  |  浏览/下载：17/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.   Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine 期刊论文  OAI收割 IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2008, 卷号: 7, 期号: 3, 页码: 215-222 作者:  Chang, Weng-Long;  Ren, Ting-Ting;  Luo, Jun;  Feng, Mang;  Guo, Minyi 收藏  |  浏览/下载：35/0  |  提交时间：2015/10/13 molecular algorithms  quantum algorithms  the NP-complete problems  the satisfiability problem   带多项式量级约束条件的多商品流BWTSP线性规划 期刊论文  OAI收割 计算机研究与发展, 2007, 卷号: 44, 期号: 10, 页码: 1796-1800 江贺; 张宪超; 车皓阳; 陈国良 收藏  |  浏览/下载：79/5  |  提交时间：2011/07/01 黑白旅行商问题  NP-难解  线性规划  完全算法  商品流  多项式  约束条件  多商品流  线性规划  Traveling Salesman Problem  权值  旅行商问题  阈值  基数  条件数  转换  指数  证明  思想  环路  归约Polynomials  Traveling salesman problem   有界单向函数的通用求逆算法研究 期刊论文  OAI收割 计算机学报, 2006, 卷号: 29, 期号: 9, 页码: 1603-1607 薛锐; 刘吉强   |  收藏  |  浏览/下载：19/0  |  提交时间：2011/07/13 密码学  单向函数  有界单向函数  可忽略函数  求逆算法  cryptography  one way function  bounded one-way function  negligible functions  inverting algorithm  通用  存在性  成功概率  computer science  正整数  算法  open problem  计算机科学  NP problem  密码系统  依赖性  困难性  设计  基础  概念   a heuristic quasi-physical strategy for solving disks packing problem 期刊论文  OAI收割 SIMULATION MODELLING PRACTICE AND THEORY, 2002, 卷号: 10, 期号: 3-4, 页码: 195-207 Huang WQ; Yan K   |  收藏  |  浏览/下载：17/0  |  提交时间：2011/07/29 packing problem  NP hard  simulated annealing  quasi-physical method