2190 search results - page 15 / 438 » An optimal algorithm to generate tilings |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
STOC
2001
ACM
14 years 8 months ago
2001
ACM
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 ...
GECCO
1999
Springer
14 years 9 days ago
1999
Springer
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...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
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...
DFT
2008
IEEE
14 years 2 months ago
2008
IEEE
Error detection/correction techniques have been advocated for algorithmic self-assembly. Under rectilinear growth, it requires only two additional tiles, generally referred to as ...