Sciweavers

2190 search results - page 15 / 438
» An optimal algorithm to generate tilings
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 5 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
GECCO
1999
Springer
145views Optimization» more  GECCO 1999»
15 years 10 months ago
Three Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem
This paper explores the use of growth processes, or embryogenies, to map genotypes to phenotypes within evolutionary systems. Following a summary of the significant features of em...
Peter J. Bentley, Sanjeev Kumar
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 11 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
DFT
2008
IEEE
107views VLSI» more  DFT 2008»
16 years 2 days ago
Checkpointing of Rectilinear Growth in DNA Self-Assembly
Error detection/correction techniques have been advocated for algorithmic self-assembly. Under rectilinear growth, it requires only two additional tiles, generally referred to as ...
Stephen Frechette, Yong-Bin Kim, Fabrizio Lombardi