Search results

Jump to navigation Jump to search

Page title matches

  • ...nd molecular computing, and the plausibility of implementing 3 dimensional self-assembly systems, our techniques may provide the needed power of temperature 2 syste |file=[[Media:Temp1 deterministic3d probablistic2d.pdf | Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D.pdf]]
    2 KB (264 words) - 13:46, 22 June 2021
  • |title=Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS an abstract model for tile based self-assembly, it has proven to be remarkably powerful and expressive in terms of the str
    1 KB (194 words) - 12:49, 22 June 2021
  • ...hat this pattern cannot self-assemble within a number of well studied tile self-assembly models. |file=[http://arxiv.org/abs/1202.5012 Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes]
    2 KB (357 words) - 12:19, 22 June 2021
  • [[Category:Self-assembly]]
    2 KB (311 words) - 11:55, 8 July 2019
  • [[Category:Self-assembly]]
    1 KB (192 words) - 15:39, 27 May 2014
  • ...ppeared. In [[Automated self-assembly programming paradigm]] Lin Li uses a self-assembly algorithm combined with genetic algorithms to generate the code for inserti In the same year Yuriy Brun in his thesis [[Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized dis
    \(1 bytes (127 words) - 11:59, 27 May 2014
  • Essentially, weak self-assembly can be thought of [[Strict Self-Assembly]]
    \(1 bytes (88 words) - 15:22, 27 May 2014
  • Essentially, strict self-assembly means that tiles are only placed ...Note that if $X \in \mathbb{Z}^2$ strictly self-assembles, then $X$ [[Weak Self-Assembly | weakly
    \(1 bytes (95 words) - 15:20, 27 May 2014
  • 5 KB (971 words) - 10:51, 27 May 2014
  • ...onal (but local) rules. The latter are considered examples of algorithmic self-assembly, since by following computational rules as they combine, the self-assemblin ...at least for mildly computationally complex algorithms). Another model of self-assembly which is non-algorithmic is [[DNA origami]].
    1 KB (175 words) - 12:09, 16 June 2016
  • \(1 bytes (5 words) - 11:00, 20 July 2016
  • [[Category:Self-assembly]] ...esigning optimal tile sets to self-assemble patterned squares, the [http://self-assembly.net/wiki/index.php/PATS_problem_and_tile_set_generation PATS problem], has
    7 KB (1,078 words) - 23:57, 7 March 2024
  • \(1 bytes (24 words) - 14:23, 27 May 2014
  • |title=Identifying Shapes Using Self-Assembly ...lgorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify
    \(1 bytes (108 words) - 12:29, 22 June 2021
  • |title=Self-Assembly with Geometric Tiles |file=[http://arxiv.org/abs/1104.2809 Self-Assembly with Geometric Tiles]
    2 KB (258 words) - 12:47, 22 June 2021
  • title = {Parallelism and Time in Hierarchical Self-Assembly}, [[Category:Self-assembly]]
    2 KB (333 words) - 15:16, 27 May 2014
  • \(1 bytes (127 words) - 14:21, 25 November 2013
  • \(1 bytes (7 words) - 15:58, 27 May 2014
  • \(1 bytes (3 words) - 11:49, 20 June 2022
  • self-assembly process. We observe that the DNA structures
    1 KB (143 words) - 20:24, 22 June 2022

Page text matches

  • [[Category:Self-assembly]]
    1 KB (188 words) - 15:21, 27 May 2014
  • |title=Self-Assembly of Infinite Structures: A Survey |abstract=We survey some recent results related to the self-assembly of infinite structures in
    \(1 bytes (89 words) - 13:13, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (98 words) - 11:13, 15 July 2016
  • [[Category:Self-assembly]]
    2 KB (311 words) - 11:55, 8 July 2019
  • |title=Self-Assembly of Discrete Self-Similar Fractals techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes
    1 KB (141 words) - 12:46, 22 June 2021
  • Essentially, strict self-assembly means that tiles are only placed ...Note that if $X \in \mathbb{Z}^2$ strictly self-assembles, then $X$ [[Weak Self-Assembly | weakly
    \(1 bytes (95 words) - 15:20, 27 May 2014
  • [[Category:Self-assembly]]
    \(1 bytes (41 words) - 15:20, 27 May 2014
  • |title=Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS an abstract model for tile based self-assembly, it has proven to be remarkably powerful and expressive in terms of the str
    1 KB (194 words) - 12:49, 22 June 2021
  • The kinetic Slat Assembly Model is a more physically realistic model of the self-assembly of slats as defined in the [[Abstract Slat Assembly Model (aSAM)]]. It is b [[Category:Self-assembly]]
    \(1 bytes (151 words) - 20:40, 26 April 2023
  • |title=Self-Assembly of Decidable Sets self-assembly. Finally, we show that our characterization is robust with respect to vario
    \(1 bytes (118 words) - 12:46, 22 June 2021
  • |title=Limitations of Self-Assembly at Temperature 1 the case of temperature 2 self-assembly, no discrete self-similar fractal weakly self-assembles at
    1 KB (144 words) - 13:14, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (13 words) - 12:52, 1 July 2019
  • |title=Intrinsic Universality in Self-Assembly ...Winfree, and of Demaine et al.) in that we simulate the actual process of self-assembly, not just the end result, as in Soloveichik and Winfree’s construction, a
    2 KB (300 words) - 13:06, 22 June 2021
  • ...self-assembly does not imply the ability to simulate arbitrary algorithmic self-assembly processes. |file=[http://arxiv.org/abs/1304.1679 Intrinsic universality in tile self-assembly requires cooperation]
    2 KB (231 words) - 12:32, 22 June 2021
  • \(1 bytes (39 words) - 15:20, 8 August 2013
  • |title=Identifying Shapes Using Self-Assembly ...lgorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify
    \(1 bytes (108 words) - 12:29, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (31 words) - 15:37, 27 May 2014
  • Essentially, weak self-assembly can be thought of [[Strict Self-Assembly]]
    \(1 bytes (88 words) - 15:22, 27 May 2014
  • ...ile assembly system T. The simulation is "intrinsic" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile o ...f the simulated system T. At each location of a potential supertile in the self-assembly of U, a decision is made whether and how to express this genome, i.e., whet
    1 KB (228 words) - 12:58, 22 June 2021
  • |abstract=Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed
    3 KB (412 words) - 10:07, 14 June 2022

View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)