7 Literal Selection in Switching Lattice Design
175
25. Cheng, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel machine scheduling research.
Eur. J. Oper. Res. (47), 271–292 (1990)
26. Gange, G., Søndergaard, H., Stuckey, P.J.: Synthesizing optimal switching lattices. ACM Trans.
Des. Autom. Electron. Syst. 20(1), 6:1–6:14 (2014)
27. Harvey, N.J., Ladner, R.E., Lovász, L., Tamir, T.: Semi-matchings for bipartite graphs and load
balancing. J. Algorithm. 59(1), 53–78 (2006)
28. Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. Eur.
J. Oper. Res. 156(1), 261–266 (2004)
29. Luccio, F., Xia, M.: The MPA graph problem. Department of Informatics, University of Pisa.
Technical Report (2018)
30. Mokotoff, E.: Parallel machine scheduling problems: a survey. Asia-Pacific J. Oper. Res. 18(2),
193–242 (2001)
31. Morgul, M.C., Altun, M.: Synthesis and optimization of switching nanoarrays. In: 2015
IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems
(DDECS), pp. 161–164. IEEE, Piscataway (2015)
32. Tunali, O., Altun, M.: Permanent and transient fault tolerance for reconfigurable nano-crossbar
arrays. IEEE Trans. CAD Integr. Circuits Syst. 36(5), 747–760 (2017)
33. Tunali, O., Altun, M.: A survey of fault-tolerance algorithms for reconfigurable nano-crossbar
arrays. ACM Comput. Surv. 50(6), 79:1–79:35 (2017)
34. Tunali, O., Altun, M.: Logic synthesis and defect tolerance for memristive crossbar arrays. In:
2018 Design, Automation & Test in Europe Conference & Exhibition, DATE 2018, Dresden,
March 19–23, 2018, pp. 425–430
35. Yang, S.: Logic Synthesis and Optimization Benchmarks User Guide Version 3.0. User Guide,
Microelectronic Center (1991)
Précédent

- 180/268

Suivant