On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems

被引：1
|
作者：
Hernandez, Nestine Hope S. [1 ]
Juayong, Richelle Ann B. [1 ]
Francia, Sherlyne L. [1 ]
Francisco, Denise Alyssa A. [1 ]
Adorna, Henry N. [1 ]
机构：
[1] Univ Philippines Diliman, Dept Comp Sci, Algorithms & Complex Lab, Quezon City 1101, Philippines
来源：
MEMBRANE COMPUTING (CMC 2015) | 2015年 / 9504卷
关键词：
Membrane computing; Evolution-communication P systems; Communication complexity; Vertex cover problem; 3-satisfiability problem; P-SYSTEMS;
D O I：
10.1007/978-3-319-28475-0_14
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper, the communication complexity of nonconfluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in Evolution-Communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by previous literature in our analysis. Solutions are constructed in several modes of operation: when communication is prioritized over evolution (CPE), when evolution is prioritized over communication (EPC) and when no priority is imposed (CME). VCP and 3SP are problems that have already been problems of interest for works that investigate communication complexity in an ECP system variant called Evolution-Communication P system with Energy (ECPe system). In this paper, we are interested in employing the technique used in ECPe system, this time for solutions in ECP system.
引用
收藏
页码：200 / 214
页数：15
相关论文
共 50 条
  • [1] AN EFFICIENT ALGORITHM FOR THE 3-SATISFIABILITY PROBLEM
    BILLIONNET, A
    SUTTER, A
    OPERATIONS RESEARCH LETTERS, 1992, 12 (01) : 29 - 36
  • [2] A NEURAL NETWORK APPROACH TO THE 3-SATISFIABILITY PROBLEM
    JOHNSON, JL
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 6 (02) : 435 - 449
  • [3] PROBABILISTIC ANALYSIS OF 2 HEURISTICS FOR THE 3-SATISFIABILITY PROBLEM
    CHAO, MT
    FRANCO, J
    SIAM JOURNAL ON COMPUTING, 1986, 15 (04) : 1106 - 1118
  • [4] Hybrid method for the approximate solution of the 3-satisfiability problem associated with the factorization problem
    Faizullin, R. T.
    Dul'keit, V. I.
    Ogorodnikov, Yu. Yu.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2013, 19 (02): : 285 - 294
  • [5] Study of computational performance of Genetic Algorithm for 3-satisfiability problem
    Ma, QingLian
    Zhang, Yu-an
    Sakamoto, Makoto
    Furutani, Hiroshi
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 16TH '11), 2011, : 354 - 358
  • [6] Exhaustive enumeration unveils clustering and freezing in the random 3-satisfiability problem
    Ardelius, John
    Zdeborovae, Lenka
    PHYSICAL REVIEW E, 2008, 78 (04):
  • [7] A New Method for 3-Satisfiability Problem Phase Transition on Structural Entropy
    Lin, Qingwen
    Wang, Xiaofeng
    Niu, Jin
    IEEE ACCESS, 2021, 9 (09): : 2093 - 2099
  • [8] The Experimental Analysis of the Efficiency of Genetic Algorithm Based on 3-satisfiability Problem
    Zhang, Yu-an
    Li, Bingfen
    Meng, Qiao
    Hu, Qiongqiong
    Ma, Qinglian
    2015 11TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2015, : 245 - 249
  • [9] ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
    Guo, Ping
    Zhang, Yang
    APPLIED INTELLIGENCE, 2022, 52 (02) : 1740 - 1751
  • [10] ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
    Ping Guo
    Yang Zhang
    Applied Intelligence, 2022, 52 : 1740 - 1751
12345