Difference between revisions of "2PATS-tileset-search"
Jump to navigation
Jump to search
(Created page with "{{SoftwareTemplate |Name=2PATS-tileset-search |Description=A distributed program to find all tilesets with a maximum size which can self-assemble a given pattern in a directed aT...") |
|||
| Line 1: | Line 1: | ||
{{SoftwareTemplate | {{SoftwareTemplate | ||
|Name=2PATS-tileset-search | |Name=2PATS-tileset-search | ||
| − | |Description=A distributed program to find all tilesets with a maximum size which can self-assemble a given pattern in a directed aTAM system. | + | |Description=A distributed program to find all tilesets with a maximum size which can self-assemble a given pattern in a directed aTAM system. The program uses a client-server model to distribute the processing. |
|Download=2PATS-tileset-search-C++.zip | |Download=2PATS-tileset-search-C++.zip | ||
}} | }} | ||
Latest revision as of 08:34, 30 March 2014
Name
2PATS-tileset-search
Description
A distributed program to find all tilesets with a maximum size which can self-assemble a given pattern in a directed aTAM system. The program uses a client-server model to distribute the processing.
