A game theoretic approach for power optimization during behavioral synthesis.
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling and binding in behavioral synthesis. The problems are formulated as auction-based noncooperative finite games for which solutions are proposed based on the Nash equilibri...
| Publicado no: | IEEE Transactions on VLSI systems 11, 6 (2003). |
|---|---|
| Autor principal: | |
| Formato: | Artigo |
| Idioma: | English |
| Assuntos: |