ACM Computing Surveys (CSUR)
Theoretical Computer Science - Natural computing
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Computing with Membranes
Data Compression
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Algorithm of active rules elimination for application of evolution rules
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
| Hi-index | 0.00 |
Several published time analyses in P systems implementation have proved that there is a very strong relationship between communication and evolution rules application time in membranes of the system. This work shows how to optimize the evolution rule application and communication times using two complementary techniques: the improvement of evolution rules algorithms and the usage of compression schema. On the one hand, this work uses the concepts of competitiveness relationship among active rules and competitiveness graph. For this, it takes into account the fact that some active rules in a membrane can consume disjoint object sets. Based on these concepts, we present a new evolution rules application algorithm that improves throughput of active rules elimination algorithms (sequential and parallel). On the other hand, this work presents an algorithm for compressing information related to multisets and evolution rules, based on the assumption that algorithmic complexity of the operations performed over multisets, in evolution rules application algorithms, is determined by the representation of multiset information of these rules. This representation also affects the communication phase among membranes phase.