Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions

DOI10.1007/s11047-010-9209-xzbMath1213.68587arXiv0710.0672MaRDI QIDQ537837

Fabio R. J. Vieira, Valmir C. Barbosa

Publication date: 23 May 2011

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.0672

zbMATH Keywords

algorithmic self-assembly; multi-objective evolutionary algorithms; minimum tile set problem

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05B45: Combinatorial aspects of tessellation and tiling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The emerging discipline of biomolecular computation in the US
• Arithmetic computation in the tile assembly model: addition and multiplication
• Two novel evolutionary formulations of the graph coloring problem
• A novel evolutionary formulation of the maximum independent set problem
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• A Self-assembly Model of Time-Dependent Glue Strength
• Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• On the Complexity of Graph Self-assembly in Accretive Systems
• Toward Minimum Size Self-Assembled Counters