|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Uniform Solution to QSAT by P Systems with Proteins显示文摘 | LU Chun SHI Xiaolong | 2012 | Chinese Journal of Electronics2012，21，4： | 5 |
| 2 | Fraction Arithmetic Operations Performed by P Systems显示文摘 | GUO Ping ZHANG Hong CHEN Haizhu CHEN Jingxin | 2013 | Chinese Journal of Electronics2013，22，4： | 4 |
| 3 | A uniform solution to the independent set problem through tissue P systems with cell separation显示文摘膜计算是自然计算的一个突现的分支,它被结构并且更高在纸巾,器官,和其它细胞的生活细胞,以及组织工作启发目结构。织物 P 系统是在膜计算的框架的大多数调查计算模型的一个班,特别在效率的方面。在一多项式时间产生一个指数的资源,房间分离被合并到如此的系统,因此获得那么与房间分离把织物称为 P 系统。在这个工作,我们利用这个模型的计算效率并且为解决独立集合问题构造如此的织物 P 系统的一个一致家庭,一个著名 NP 完全的问题,一个有效解决方案能被在多项式时间获得。 | Xingyi ZHANG Xiangxiang ZENG Bin LUO Zheng ZHANG | 2012 | Frontiers of Computer Science2012，6，4： | 0 |
| 4 | A membrane-inspired algorithm with a memory mechanism for knapsack problems显示文摘Membrane algorithms are a class of distributed and parallel algorithms inspired by the structure and behavior of living cells. Many attractive features of living cells have already been abstracted as operators to improve the performance of algorithms. In this work, inspired by the function of biological neuron cells storing information, we consider a memory mechanism by introducing memory modules into a membrane algorithm. The framework of the algorithm consists of two kinds of modules (computation modules and memory modules), both of which are arranged in a ring neighborhood topology. They can store and process information, and exchange information with each other. We test our method on a knapsack problem to demonstrate its feasibility and effectiveness. During the process of approaching the optimum solution, feasible solutions are evolved by rewriting rules in each module, and the information transfers according to directions defined by communication rules. Simulation results showed that the performance of membrane algorithms with memory cells is superior to that of algorithms without memory cells for solving a knapsack problem. Furthermore, the memory mechanism can prevent premature convergence and increase the possibility of finding a global solution. | Juan-juan HE Jian-hua XIAO Xiao-long SHI Tao SONG | 2013 | Journal of Zhejiang University-Science C(Computers and Electronics)2013，14，8： | 0 |
| 5 | Tissue P Systems with Look-ahead Mode显示文摘Tissue P systems are a class of distributed and parallel computing models inspired from inter-cellular communication and cooperation between cells. In this work, a variant of tissue P system, named tissue P system with look-ahead mode, is discussed for decreasing the inherent non-determinism of tissue P systems and helping implementing tissue P systems on computers. Such systems are proved to be universal by simulating register machine, and they are also proved to be able to efficiently solve computationally hard problems by means of a spacetime tradeoff, which is illustrated with a polynomial solution to 3-coloring problem. | JIANG Yun SONG Tao ZHANG Zheng | 2014 | Chinese Journal of Electronics2014，23，1： | 0 |
| 6 | 基于膜计算模型的点集匹配算法显示文摘点集匹配是计算机视觉和模式识别领域中的一个经典NP问题。膜计算为自然计算的新分支,旨在从单个细胞或组织及器官等细胞群的结构和功能中抽象出新的计算模型或计算思想。在嵌套结构膜优化算法的基础上,提出了一种新的基于膜计算模型的点集匹配算法,结合点集匹配问题的特点,算法引入了三种新的启发式搜索规则,在一定程度上进一步提高了匹配的正确率。与传统优化算法相比,这种新的方法具有更好的全局搜索能力,因此,能够获得点集匹配问题的较好解。实验结果表明,该方法对点集匹配问题的求解是有效的,具有较高的匹配精度和较好的稳定性。 | 汤进 丁转莲 张兴义 罗斌 | 2013 | 红外与激光工程2013，42，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员