Networks of splicing processors with evaluation sets as optimization problems solvers

DOI10.1016/J.INS.2016.07.036zbMath1428.68154OpenAlexW2496157092MaRDI QIDQ2282068

Victor Mitrana, Jose Ramon Sanchez Couso, Sandra Gómez Canaval

Publication date: 6 January 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.07.036

zbMATH Keywords

optimization problem0/1 knapsack problembio-inspired computational modelsplicing operationsplicing processor with evaluation sets

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

Polarization: a new communication protocol in networks of bio-inspired processors ⋮ A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accepting networks of genetic processors are computationally complete
• Accepting networks of splicing processors: complexity results
• Networks of polarized evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• On small, reduced, and fast universal accepting networks of splicing processors
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Parallel Algorithms for Knapsack Type Problems
• Networks of Polarized Evolutionary Processors Are Computationally Complete
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• New Computational Paradigms
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: Networks of splicing processors with evaluation sets as optimization problems solvers