Sciweavers

46 search results - page 1 / 10
» Solving NP-complete problems in the tile assembly model
Sort
View
TCS
2008
13 years 4 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
JAL
2008
74views more  JAL 2008»
13 years 4 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
DNA
2009
Springer
145views Bioinformatics» more  DNA 2009»
13 years 11 months ago
Distributed Agreement in Tile Self-assembly
Abstract. Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several rese...
Aaron Sterling
SODA
2010
ACM
426views Algorithms» more  SODA 2010»
14 years 2 months ago
Shape Replication Through Self-Assembly and RNase Enzymes
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...
Zachary Abel, Nadia Benbernou, Mirela Damian, Erik...
ICS
2010
Tsinghua U.
13 years 8 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling