Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Solving the Set Cover Problem in the Tile Assembly Model
verfasst von : Zhou Xu, Zhou Yan Tao, Li Ken Li
Erschienen in: Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
The tile assembly model is a novel biological computing model that is scalable and has highly parallel computing ability. In this paper, the tile assembly model can be applied to solve the set cover problem which is a well-known NP-complete problem. In order to achieve this, we design a MinSetCover system which is composed of three parts, the initial configuration subsystem, the nondeterministic choosing subsystem and the detecting subsystem. Then we analysis the system’s complexity and certify the system’s correctness by experiment simulation.