Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method

@inproceedings{Seda2012HeuristicSP,
  title={Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method},
  author={Milos Seda},
  year={2012}
}
Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give… CONTINUE READING
3 Citations
21 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

A Genetic Algorithm for the Set Covering Problem,

  • J. E. Beasley P.C. Chu
  • Journal of Operational Research,
  • 1996
Highly Influential
3 Excerpts

DePuy, “On the Effectiveness of Incorporating Randomness and Memory into a Multi-Start Metaheuristic with Application to the Set Covering Problem,

  • G.W.G. Lan
  • Computers & Industrial Engineering,
  • 2006
1 Excerpt

Logic Functions and Equations: Binary Models for Computer Science

  • Ch. Posthoff, B. Steinbach
  • Berlin: Springer-Verlag,
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…