A linear time complexity of breadth-first search using P system with membrane division
One of the known methods for solving the problems with exponential time complexity such as NP-complete problems is using the brute force algorithms. Recently, a new parallel computational framework called Membrane Computing is introduced which can be applied in brute force algorithms. The usual way...
Main Authors: | Salehi, Einallah (Author), Shamsuddin, Siti Mariyam (Author), Nemati, Kourosh (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Publishing Corporation,
2013.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
A Linear Time Complexity of Breadth-First Search Using P System with Membrane Division
by: Einallah Salehi, et al.
Published: (2013-01-01) -
Simulation of pornography web sites (PWS) classification using principal component analysis with neural network
by: Zhi, Sam Lee, et al.
Published: (2008) -
Shape-based two dimensional descriptor for searching molecular database
by: Hamza, Hentabli
Published: (2014) -
Analisis penyampulan data menggunakan model pengaturcaraan linear
by: Abd. Rahman, Syed Othmawi
Published: (1995) -
Evaluating the complexity of UML class diagrams
by: Shafiabady, Aida
Published: (2013)