Works (2)
Updated: April 11th, 2023 10:13
2003 conference paper
Equivalence classes of circuit mutants for experimental design
Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 432–435.
TL;DR:
A method to generate tightly controlled equivalence classes of circuit mutants, given the graph-based characterization of a reference netlist, which an general may contain cycles is introduced.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
1999 chapter
Heuristics and experimental design for bigraph crossing number minimization
In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93).
TL;DR:
Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented and outperform existing heuristic on graph classes that range from application-specific to random.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018