A fast P system for finding a balanced 2-partition

  • Authors:
  • Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez

  • Affiliations:
  • Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, Sevilla University Avda Reina Mercedes s/n, 41012, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, Sevilla University Avda Reina Mercedes s/n, 41012, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, Sevilla University Avda Reina Mercedes s/n, 41012, Sevilla, Spain

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerical problems are not very frequently addressed in the P systems literature. In this paper we present an effective solution to the 2-Partition problem via a family of deterministic P systems with active membranes using 2-division. The design of this solution is a sequel of several previous works on other problems, mainly on the Subset-Sum and the Knapsack problems. Several improvements are introduced and explained.