Solving Multidimensional 0-1 Knapsack Problem with Time-Free Tissue P Systems | Zendy

Xiangrong Liu | Zendy; Ziming Li | Zendy; Juan Juan Suo | Zendy; Ying Ju | Zendy; Juan Liu | Zendy; Xiangxiang Zeng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solving Multidimensional 0-1 Knapsack Problem with Time-Free Tissue P Systems

Author(s) -

Xiangrong Liu,

Ziming Li,

Juan Juan Suo,

Ying Ju,

Juan Liu,

Xiangxiang Zeng

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/372768

Subject(s) - knapsack problem , construct (python library) , computer science , class (philosophy) , feature (linguistics) , mathematical optimization , distributed computing , mathematics , algorithm , artificial intelligence , linguistics , philosophy , programming language

Tissue P system is a class of parallel and distributed model; a feature of traditional tissue P system is that the execution time of certain biological processes is very sensitive to environmental factors that might be hard to control. In this work, we construct a family of tissue P systems that works independently from the values associated with the execution times of the rules. Furthermore, we present a time-free efficient solution to multidimensional 0-1 knapsack problem by timed recognizer tissue P systems

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research