A parallel membrane inspired harmony search for optimization problems: A case study based on a flexible job shop scheduling problem
Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by
musical improvisation processes, and it can solve various optimization problems. Membrane …
musical improvisation processes, and it can solve various optimization problems. Membrane …
Distributed algorithms over communicating membrane systems
G Ciobanu - Biosystems, 2003 - Elsevier
This paper presents fundamental distributed algorithms over membrane systems with
antiport carriers. We describe distributed algorithms for collecting and dispersing …
antiport carriers. We describe distributed algorithms for collecting and dispersing …
Parallel and distributed algorithms in P systems
R Nicolescu - International Conference on Membrane Computing, 2011 - Springer
Our group's recent quest has been to use P systems to model parallel and distributed
algorithms. Several framework extensions are recalled or detailed, in particular, modular …
algorithms. Several framework extensions are recalled or detailed, in particular, modular …
A distributed simulation of transition P systems
P systems is a new model of computation, inspired by natural processes, that has a
distributive nature. By exploring this distributive nature of P systems, we have built a purely …
distributive nature. By exploring this distributive nature of P systems, we have built a purely …
Analysis, design and management of multimedia multiprocessor systems
A Kumar - 2009 - research.tue.nl
The design of multimedia platforms is becoming increasingly more complex. Modern
multimedia systems need to support a large number of applications or functions in a single …
multimedia systems need to support a large number of applications or functions in a single …
A flat process calculus for nested membrane interactions
The link-calculus has been recently proposed as a process calculus for representing
interactions that are open (ie that the number of processes may vary), and multiparty (ie that …
interactions that are open (ie that the number of processes may vary), and multiparty (ie that …
A faster P solution for the Byzantine agreement problem
MJ Dinneen, YB Kim, R Nicolescu - … CMC 2010, Jena, Germany, August 24 …, 2011 - Springer
We propose an improved generic version of P modules, an extensible framework for
recursive composition of P systems. We further provide a revised P solution for the Byzantine …
recursive composition of P systems. We further provide a revised P solution for the Byzantine …
P systems and the Byzantine agreement
MJ Dinneen, YB Kim, R Nicolescu - The Journal of Logic and Algebraic …, 2010 - Elsevier
We first propose a modular framework for recursive composition of P systems. This modular
approach provides encapsulation and information hiding, facilitating the design of P …
approach provides encapsulation and information hiding, facilitating the design of P …
HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF AP SYSTEM?
F Bernardini, M Gheorghe, M Margenstern… - International Journal of …, 2008 - World Scientific
We consider the problem of synchronizing the activity of all the membranes of a P system.
After pointing at the connection with a similar problem dealt with in the field of cellular …
After pointing at the connection with a similar problem dealt with in the field of cellular …
[HTML][HTML] Further results on generalised communicating P systems
In this paper we consider four restricted cases of the generalised communicating P systems
and study their computational power, by providing improved results, with respect to the …
and study their computational power, by providing improved results, with respect to the …