HARD: A hypercube embedding algorithm for state assignment of finite state machines (Q1860064)
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: HARD: A hypercube embedding algorithm for state assignment of finite state machines |
scientific article; zbMATH DE number 1872221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | HARD: A hypercube embedding algorithm for state assignment of finite state machines |
scientific article; zbMATH DE number 1872221 |
Statements
HARD: A hypercube embedding algorithm for state assignment of finite state machines (English)
0 references
20 February 2003
0 references
hypercube embedding
0 references
state assignment
0 references
finite state machines
0 references
logarithmic barrier function method
0 references
Kernighan-Lin
0 references
network of workstations
0 references
message passing interface
0 references
0.8269232
0 references
0.82546943
0 references
0.8192856
0 references
0.81156445
0 references
0.80938387
0 references
0.80481243
0 references
0.8015989
0 references
0.8013323
0 references
