Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247)
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 6945274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using well-solvable minimum cost exact covering for VLSI clock energy minimization |
scientific article; zbMATH DE number 6945274 |
Statements
Using well-solvable minimum cost exact covering for VLSI clock energy minimization (English)
0 references
28 September 2018
0 references
well-solvable problems
0 references
exact covering
0 references
perfect graph matching
0 references
VLSI clocking
0 references
multi-bit flip-flop
0 references
0.8381003141403198
0 references
0.7946897149085999
0 references
0.681128740310669
0 references
0.6686890125274658
0 references
