A linear-time solution for the knapsack problem with active membranes

Fri, 11/30/2007 - 11:24 — ana

Title	A linear-time solution for the knapsack problem with active membranes
Publication Type	Journal Papers
Year of Publication	2004
Authors	Pérez-Jiménez, M. J., & Riscos-Núñez A.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-20895-2
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	2933
Pages	250-268
Abstract	Up to now, P systems dealing with numerical problems have been rarely considered in the literature. In this paper we present an effective solution to the Knapsack problem using a family of deterministic P systems with active membranes using 2-division. We show that the number of steps of any computation is of linear order, but polynomial time is required for pre-computing resources.
URL	http://www.springerlink.com/content/w9022lqp0llrp59r/?p=66cbdb919de942eaa08b51f476e22861&pi=18
ISSN Number	0302-9743
DOI	10.1007/b95207

Research Group on Natural Computing