Spiking neural P systems with neuron division and budding
Tóm tắt
Từ khóa
Tài liệu tham khảo
Ionescu M, Păun Gh, Yokomori T. Spiking neural P systems. Fund Inform, 2006, 71: 279–308
Chen H, Ionescu M, Ishdorj T O, et al. Spiking neural P systems with extended rules: universality and languages. Nat Comput, 2008, 7: 147–166
Chen H, Freund R, Ionescu M, et al. On string languages generated by spiking neural P systems. Fund Inform, 2007, 75: 141–162
Chen H, Ionescu M, Ishdorj T O. On the efficiency of spiking neural P systems. In: Proceedings of the 8th International Conference on Electronics, Information, and Communication. Ulan Bator 2006. 49–52
Ishdorj T O, Leporati A. Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources. Nat Comput, 2008, 7: 519–534
Leporati A, Gutiérrez-Naranjo M A. Solving Subset Sum by spiking neural P systems with pre-computed resources. Fund Inform, 2008, 87: 61–77
Leporati A, Zandron C, Ferretti C, et al. Solving numerical NP-complete problem with spiking neural P systems. In: 8th Workshop on Membrane Computing, LNCS Vol. 4860. Berlin: Springer-Verlag, 2007. 336–352
Ferretti C, Leporati A, Mauri G, et al. On the computational power of spiking neural P systems. Int J Unconvent Comput, 2009, 5: 459–473
Leporati A, Mauri G, Zandron C, et al. Uniform solutions to SAT and Subset Sum by spiking neural P systems. Nat Comput, 2009, 8: 681–702
The P systems Website: http://ppage.psystems.eu
Garey M R, Johnson D S. Computers and Intractability. A Guide to the Theory of NP-completeness. San Francisco: W H Freeman and Company, 1979