An emergent computation approach to the problem of polygon layout with performance constraints (Q1673263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An emergent computation approach to the problem of polygon layout with performance constraints |
scientific article; zbMATH DE number 6935279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An emergent computation approach to the problem of polygon layout with performance constraints |
scientific article; zbMATH DE number 6935279 |
Statements
An emergent computation approach to the problem of polygon layout with performance constraints (English)
0 references
11 September 2018
0 references
packing problem with constraints
0 references
multi-agent system
0 references
self-organization emergence algorithm
0 references
no-fit polygon
0 references
generalized simulated annealing
0 references
0 references
0.6994401812553406
0 references
0.6925958395004272
0 references
0.670660674571991
0 references
