Heuristic chaining in directed acyclic graphs (Q3142277)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 446251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic chaining in directed acyclic graphs |
scientific article; zbMATH DE number 446251 |
Statements
Heuristic chaining in directed acyclic graphs (English)
0 references
15 November 1993
0 references
RISC
0 references
vector processing
0 references
code generation
0 references
instruction chaining
0 references
directed acyclic graphs
0 references
NP-complete
0 references
heuristic
0 references
0.7272064685821533
0 references
0.7227823734283447
0 references
0.7194752097129822
0 references
