Solving numerical NP-complete problems with spiking neural P systems

A Leporati, C Zandron, C Ferretti, G Mauri - Membrane Computing: 8th …, 2007 - Springer
Starting from an extended nondeterministic spiking neural P system that solves the Subset
Sum problem in a constant number of computation steps, recently proposed in a previous …

[PDF][PDF] On the computational power of spiking neural P systems

A Leporati, C Zandron, C Ferretti, G Mauri - Proceedings of Fifth …, 2007 - ibn.idsi.md
In this paper we study some computational properties of spiking neural P systems. In
particular, we show that by using nondeterminism in a slightly extended version of spiking …

DICE: Internet delivery of immersive voice communication for crowded virtual spaces

P Boustead, F Safaei… - IEEE Proceedings. VR …, 2005 - ieeexplore.ieee.org
This paper develops a scalable system design for the creation, and delivery over the
Internet, of a realistic voice communication service for crowded virtual spaces. Examples of …

[HTML][HTML] On the computational efficiency of tissue P systems with evolutional symport/antiport rules

L Pan, B Song, C Zandron - Knowledge-Based Systems, 2023 - Elsevier
Tissue P systems with evolutional symport/antiport rules are a variant of tissue P systems,
where objects are communicated through regions by symport/antiport rules, and objects may …

Solving Subset Sum by spiking neural P systems with pre-computed resources

A Leporati, MA Gutiérrez-Naranjo - Fundamenta Informaticae, 2008 - content.iospress.com
Recently the possibility of using spiking neural P systems for solving computationally hard
problems has been considered. Such solutions assume that some (possibly exponentially …

Asynchronous P systems for hard graph problems

K Tanaka, A Fujiwara - International Journal of Networking and …, 2014 - jstage.jst.go.jp
In the present paper, we consider fully asynchronous parallelism in membrane computing
and propose asynchronous P systems for the following four graph problems: minimum …

An asynchronous P system with the Bron-Kerbosch algorithm for solving the maximum clique

T Noguchi, A Fujiwara - International Journal of Networking and …, 2023 - jstage.jst.go.jp
Membrane computing, which is also known as a P system, is a computational model
inspired by the activity of living cells. Several P systems, which work in a polynomial number …

An asynchronous P system with branch and bound for solving the knapsack problem

Y Nakano, A Fujiwara - 2020 Eighth International Symposium …, 2020 - ieeexplore.ieee.org
Membrane computing, which is a computational model based on cell activity, has
considerable attention as a new computation paradigm. In general membrane computing …

On maximal parallel application of rules in rewriting P systems

C Zandron - Journal of Membrane Computing, 2023 - Springer
In rewriting P systems, that is P systems using structured strings instead of atomic symbols,
rules can be applied in parallel on all strings, but a single rule at a time can be applied on …

An asynchronous P system with a dpll algorithm for solving sat

T Noguchi, A Fujiwara - International Journal of Networking and …, 2022 - jstage.jst.go.jp
Membrane computing, which is also known as P system, is a computational model inspired
by the activity of living cells. Several efficient P systems, which work in a polynomial number …