Solving multidimensional 0-1 knapsack problem with time-free tissue P systems (Q1714579)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving multidimensional 0-1 knapsack problem with time-free tissue P systems |
scientific article; zbMATH DE number 7010613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving multidimensional 0-1 knapsack problem with time-free tissue P systems |
scientific article; zbMATH DE number 7010613 |
Statements
Solving multidimensional 0-1 knapsack problem with time-free tissue P systems (English)
0 references
1 February 2019
0 references
Summary: 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.
0 references