A polynomial time algorithm for solving the word-length optimization problem.

Karthick Parashar Daniel Ménard Olivier Sentieys

Published in: ICCAD (2013)

Keyphrases

branch and bound search
experimental evaluation
optimization process
computational complexity
evolutionary algorithm
probabilistic model
worst case
objective function
optimal solution
np hard
segmentation algorithm
optimization algorithm
optimization method
recognition algorithm
strongly polynomial