On optimal flip-flop grouping for VLSI power minimization
Year of publication: |
2013
|
---|---|
Authors: | Wimer, Shmuel |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 5, p. 486-489
|
Subject: | NP-hardness | Minimum cost perfect matching | VLSI clock gating | VLSI power optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Integer knapsack problems with profit functions of the same value range
Gurevsky, Evgeny, (2023)
-
The complexity of minimizing the difference of two M⇋-convex set functions
Kobayashi, Yusuke, (2015)
-
The linear complementarity problems with a few variables per constraint
Sumita, Hanna, (2015)
- More ...
-
On optimal flip-flop grouping for VLSI power minimization
Wimer, Shmuel, (2013)
-
The complexity of VLSI power-delay optimization by interconnect resizing
Moiseev, Konstantin, (2012)
-
Using well-solvable minimum cost exact covering for VLSI clock energy minimization
Wimer, Shmuel, (2014)
- More ...