Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Unconventional Computing Models

Sortuj według:

Ogranicz wyniki do:

DNA and Membrane Algorithms for SAT

Manca V.

Fundamenta Informaticae

2002

Vol. 49, nr 1-3

205-221

Some DNA algorithms proposed in the literature for propositional satisfiability (SAT) are analyzed. In the class of `extract model' the two sub-classes of `literal string' and `clause string' algorithms are compared and a new formulation of these algorithms is given in terms of membrane systems. Then, the duality between literal string and clause string formulation of SAT is expressed by means of `singleton matrices' that introduce another membrane algorithm for SAT. The analysis developed suggests the perspective of membrane systems as problem-solving agents based on molecule localization, transformation, and propagation.