A Polynomial Time Algorithm for Solving the Word-length Optimization Problem

Karthick Parashar 1 Daniel Menard 2 Olivier Sentieys 1
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
2 IETR - Institut d'Electronique et de Télécommunications de Rennes
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-00876132
Contributor : Daniel Menard <>
Submitted on : Wednesday, October 23, 2013 - 5:32:18 PM
Last modification on : Friday, January 10, 2020 - 1:28:15 AM

Identifiers

  • HAL Id : hal-00876132, version 1

Collections

CNRS | INRIA | UNIV-NANTES | UNIV-RENNES1 | IRISA | IETR | IETR-INSA | INSA-RENNES | IRISA-D3 | INSTITUT-TELECOM | UR1-UFR-ISTIC | IETR-VAADER | UNIV-RENNES | INSA-GROUPE

Citation

Karthick Parashar, Daniel Menard, Olivier Sentieys. A Polynomial Time Algorithm for Solving the Word-length Optimization Problem. IEEE/ACM International Conference on Computer-Aided Design (ICCAD), Nov 2013, San Diego, United States. ⟨hal-00876132⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

2677

 

 

Contact

archive-ouverte@inria.fr