Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode

Yun Yun Niu; Zhi Gao Wang

doi:10.4028/www.scientific.net/AMM.568-570.802

Paper Titles

Global Path Planning Method for USV System Based on Improved Ant Colony Algorithm
p.785

Hybrid Iterative Approximation Method for a Fixed Point of Nonexpansive Mapping and Equilibrium Problem
p.789

Introducing Genetic Algorithm as an Intelligent Optimization Technique
p.793

Research of Association Rules Algorithm Based on Matrix under Cloud Computing
p.798

Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode
p.802

The Research of Algorithm of Optimum Route Calculation in Express Traffic System Based on Time Measure
p.807

Time-Free Solution for QSAT by Using Timed Tissue P Systems
p.812

Research on the GPS Elevation Fitting with RBF Neural Network Model Considering Effects of Sample Data Preprocessing
p.817

A Survey of Quantum Genetic Algorithm for Combinatorial Optimization Problems
p.822

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 568-570Semi-Uniform Solution for Common Algorithmic...

Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode

Abstract:

It is known that the Common Algorithmic Problem (CAP) has a nice property that several other NP-complete problems can be reduced to it in linear time. In the literature, the decision version of this problem can be efficiently solved with a family of recognizer P systems with active membranes with three electrical charges working in the maximally parallel way. We here work with a variant of P systems with active membranes that do not use polarizations and present a semi-uniform solution to CAP in the minimally parallel mode.

You might also be interested in these eBooks

Measurement Technology and its Application III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 568-570)

Pages:

802-806

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.568-570.802

Citation:

Cite this paper

Online since:

June 2014

Authors:

Yun Yun Niu*, Zhi Gao Wang

Keywords:

Common Algorithmic Problem, Membrane Computing, Minimal Parallelism, NP-Complete Problem, P System with Active Membranes

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Gh. Păun: Journal of Computer and System Sciences Vol. 61(1) (2001), pp.108-143.

Google Scholar

[2] A. Alhazov, C. Martín Vide and L. Pan: Fundamenta Informaticae Vol. 58(2)(2003), pp.67-77.

Google Scholar

[3] L. Pan and C. Martín Vide: Journal of Parallel and Distributed Computing Vol. 65(2005), pp.1578-1584.

Google Scholar

[4] A. Alhazov, L. Pan and Gh. Păun: Acta Informaticae Vol. 41(2004), pp.111-144.

Google Scholar

[5] A. Alhazov and M.J. Pérez-Jiménez: Lecture Notes in Computer Science Vol. 4664(2007), pp.122-133.

Google Scholar

[6] G. Ciobanu, L. Pan, Gh. Păun and M.J. Pérez-Jiménez: Theoretical Computer Science Vol. 378(2007), pp.117-130.

DOI: 10.1016/j.tcs.2007.03.044

Google Scholar

[7] T. Head, M. Yamamura and S. Gal: Proceedings of the Congress on Evolutionary Computation 1999, IEEE Service Center, Piscataway, NJ, 1999, pp.1006-1010.

Google Scholar

[8] M.J. Pérez-Jiménez and F.J.R. Campero: Lecture Notes in Computer Science Vol. 3354(2005), pp.304-315.

Google Scholar