<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A fast P system for finding a balanced 2-partition</style></title><secondary-title><style face="normal" font="default" size="100%">Soft Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Complexity class - Membrane computing - Active membranes - NP-Complete problem</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2005</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/787ktn157xv6ub32/?p=78b9bdeb5b6b4971a06d7ca7467298fa&pi=6</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://cantor.cs.us.es/files/A fast P system.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">673-678</style></pages><abstract><style face="normal" font="default" size="100%">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.
</style></abstract><issue><style face="normal" font="default" size="100%">9</style></issue></record></records></xml>