id: 05336870
dt: j
an: 05336870
au: Baer, J.-L.; Koyama, B.
ti: On the minimization of the width of the control memory of microprogrammed
    processors.
so: IEEE Trans. Comput. 28, No. 04, 310-316 (1979).
py: 1979
pu: Institute of Electrical and Electronics Engineers (IEEE), Washington, DC
la: EN
cc: 
ut: NP-complete.; branch and bound algorithm; bin packing; control store width;
    microprogramming; near-optimal solutions
ci: 
li: doi:10.1109/TC.1979.1675352
ab: Summary: A branch and bound method to minimize the width of the control
    memory of microprogrammed processors is given. Although it is
    exponential in the worst case, it appears much more effective than
    previous enumerative solutions. Furthermore, it can lead quickly to
    near-optimal solutions representing "good engineering" reductions.
rv: