Simple neural-like P systems formaximal independent set selection

Neural Computation

Volumn 25, Issue 6, 2013, Pages 1642-1659

  Xu, Lei ^a   Jeavons, Peter ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL NEURAL NETWORK; BIOLOGICAL MODEL; BRAIN; COMPUTER SIMULATION; CYTOLOGY; HUMAN; LEARNING; LETTER; NERVE CELL; PHYSIOLOGY; PROBABILITY;

BRAIN; COMPUTER SIMULATION; HUMANS; MODELS, NEUROLOGICAL; NEURAL NETWORKS (COMPUTER); NEURONS; PROBABILITY; SET (PSYCHOLOGY);

EID: 84877794722     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00443     Document Type: Letter

References (38)

1. Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., & Kuhn, F. (2011). Beeping a maximal independent set. In Proceedings of the 25th International Conference on Distributed Computing (pp. 32-50). Berlin: Springer-Verlag.
2. Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., & Bar-Joseph, Z. (2011). A biological solution to a fundamental distributed computing problem. Science, 331(6014), 183-185.
3. Alhazov, A.,Martín-Vide, C., & Pan, L. (2003). Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae, 58(2), 67-77.
4. Alon,N., Babai, L.,&Itai, A. (1986).Afast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7, 567-583.
5. Cardona, M., Colomer, M. A., Margalida, A., Palau, A., Pérez-Hurtado, I., Pérez-Jiménez,M. J., et al. (2011). A computational modeling for real ecosystems based on P systems. Natural Computing, 10(1), 39-53.
6. Ciobanu, G., Pan, L., Pǎun, G.,&Pérez-Jiménez,M. J. (2007). P systemswith minimal parallelism. Theoretical Computer Science, 378(1), 117-130.
7. Colomer, M. A., del Amor,M.A.M., Pérez-Hurtado, I., Pérez-Jiménez,M. J.,&Riscos- Núñez, A. (2010). A uniform framework for modeling based on P systems. In Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications (pp. 616-662). Piscataway, NJ: IEEE.
8. Díaz-Pernil, D., Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Riscos-N úñez, A. (2008). A uniform family of tissue P systems with cell division solving 3-COL in a linear time. Theoretical Computer Science, 404(1-2), 76-87.
9. Goldberg, M. K., & Spencer, T. H. (1987). A new parallel algorithm for the maximal independent set problem. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science (pp. 161-165). Piscataway, NJ: IEEE.
10. Ionescu, M., Martín-Vide, C., Pǎun, A., & Pǎun, G. (2003). Unexpected universality results for three classes of P systems with symport/antiport. Natural Computing, 2(4), 337-348.
11. Ionescu, M., Pǎun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2-3), 279-308.
12. Ishdorj, T.-O., Leporati, A., Pan, L., Zeng, X., & Zhang, X. (2010). Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Theoretical Computer Science, 411(25), 2345-2358.
13. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J.W. Thatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum Press.
14. Kroeker, K. L. (2011). Biology-inspired networking. Communications of the ACM, 54, 11-13.
15. Kuhn, F., Moscibroda, T., Nieberg, T., & Wattenhofer, R. (2005). Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In P. Fraigniaud (Ed.), Lecture Notes in Computer Science: Vol. 3724. Distributed computing (pp. 273-283). Berlin: Springer.
16. Kuhn, F.,Moscibroda, T.,&Wattenhofer, R. (2006). The price of being near-sighted. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm (pp. 980-989). New York: ACM.
17. Leporati, A., Zandron, C., Ferretti, C., & Mauri, G. (2007). Solving numerical NP-complete problems with spiking neural P systems. In Proceedings of the 8th International Conference on Membrane Computing (pp. 336-352). Berlin: Springer- Verlag.
18. Linial, N. (1992). Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1), 193-201.
19. Luby,M. (1985). A simple parallel algorithm for the maximal independent set problem. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (pp. 1-10). New York: ACM.
20. Lynch, N. A. (1996). Distributed Algorithms. San Francisco: Morgan Kaufmann. Martín-Vide, C., Pǎun, G., Pazos, J., & Rodríguez-Patn, A. (2003). Tissue P systems. Theoretical Computer Science, 296(2), 295-326.
21. Martín-Vide, C., Pǎun, G., Pazos, J., & Rodríguez-Patn, A. (2003). Tissue P systems. Theoretical Computer Science, 296(2), 295-326.
22. Moscibroda, T., & Wattenhofer, R. (2005). Maximal independent sets in radio networks. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (pp. 148-157). New York: ACM.
23. Nicolescu, R. (2012). Parallel and distributed algorithms in P systems. In M. Gheorghe, G. Pǎun, G. Rozenberg, A. Salomaa, & S. Verlan (Eds.), Lecture Notes in Computer Science: Vol. 7184. Membrane computing (pp. 35-50). Berlin: Springer.
24. Nicolescu, R., & Wu, H. (2011). BFS solution for disjoint paths in P systems. In Proceedings of the 10th International Conference on Unconventional Computation (pp. 164-176). Berlin: Springer-Verlag.
25. Pan, L., Pǎun, G.,&Pérez-Jiménez,M. J. (2011). Spiking neural P systemswith neuron division and budding. Science China Information Sciences, 54(8), 1596-1607.
26. Pan, L., & Pérez-Jiménez, M. J. (2010). Computational complexity of tissue-like P systems. Journal of Complexity, 26(3), 296-315.
27. Pan, L., Wang, J., & Hoogeboom, H. J. (2012). Spiking neural P systems with astrocytes. Neural Computation, 24(3), 805-825.
28. Pan, L., Zeng, X., & Zhang, X. (2011). Time-free spiking neural P systems. Neural Computation, 23(5), 1320-1342.
29. Pǎun, G. (2000a). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108-143
30. Pǎun, G. (2000b). Computingwithmembranes: AttackingNP-complete problems. In I. Antoniou, C. Calude, & M. Dinneen (Eds.). Unconventional models of computation (pp. 94-115). Berlin: Springer-Verlag.
31. Pǎun, G.,Rozenberg,G.,&Salomaa, A. (Eds.). (2010). TheOxford handbook of membrane computing. New York: Oxford University Press.
32. Peleg, D. (2000). Distributed computing: A locality-sensitive approach. Philadelphia: Society for Industrial and Applied Mathematics.
33. Pérez-Jiménez, M. J. (2009). Computational complexity in P systems. Scholarpedia, 4(11), 9290.
34. Pérez-Jiménez, M. J. (2010). A computational complexity theory in membrane computing. Lecture Notes in Computer Science: Vol. 5957. Membrane computing (pp. 125- 148). Berlin: Springer-Verlag.
35. Romero-Campero, F. J.,&Pérez-Jiménez,M. J. (2008).Amodel of the quorumsensing system in Vibrio fischeri using P systems. Artificial Life, 14(1), 95-109.
36. Xu, L. (2010). Modelling to contain pandemic influenza A (H1N1) with stochastic membrane systems: A work-in-progress paper. In 5th International ICST Conference on Bio-Inspired Models of Network, Information, and Computing Systems. Berlin: Springer-Verlag.
37. Xu, L., Lu, C., & Zhang, Z. (2010).Membrane systemswith peripheral proteins using cell division. Journal of Computational and Theoretical Nanoscience, 7(11), 2355-2359.
38. Xu, L., Zeng, X.,&Jeavons, P. (2012). Apolynomial time solution to constraint satisfaction problems by neural-like P systems. Paper presented at the Asian Conference on Membrane Computing.