Title
An Asynchronous P System For Max-Sat
Abstract
Membrane computing, which is a computational model based on cell activity, has considerable attention as one of new paradigms of computations. In the membrane computing, the asynchronous parallelism must be considered to make the membrane computing more realistic.We propose an asynchronous P system that solves the maximum satisfiability problem (MAX-SAT) with n variables and m clauses. The proposed P system computes MAX-SAT in O(mn2(n)) sequential steps or O(mn) parallel steps using O(mn) kind of objects and evolution rules of size O(m(2)n).
Year
DOI
Venue
2016
10.1109/CANDAR.2016.34
2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)
Field
DocType
ISSN
Evolution biology,Maximum satisfiability problem,Asynchronous communication,Computer science,Parallel computing,Parallel processing,Membrane computing,Computation,P system
Conference
2379-1888
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Junichiro Imatomi100.34
Akihiro Fujiwara212227.25