Skip to main content

Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit

  • Genetic Algorithms
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature (PPSN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 496))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U. Lauter: ”A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation”, Proc. 16th Design Automation Conf., 1979, pp. 1–10

    Google Scholar 

  2. M. A. Breuer: ”Design Automation of Digital Systems”, Chapter 4, Prentice Hall, 1972

    Google Scholar 

  3. D. G. Schweikert, B. W. Kernighan: ”A Proper Model for the Partitioning of Electrical Circuits”, Proc. Design Aut. Workshop, June 1972, pp. 56–62

    Google Scholar 

  4. L., R. Hyafil, L. Rivest: ”Graph Partitioning and Constructing Optimal Decision Trees are Poynomial Complete Problems”, IRIA laboria, Rapport de Recherche 33, Le Chesnay, 1973

    Google Scholar 

  5. D. E. Goldberg: ”Genetic Algorithms in Search, Optimization, and Machine Learning”, Addison-Wesley, 1989

    Google Scholar 

  6. I. Rechenberg: ”Evolutionsstrategie, Optimierung technischer Systeme nach Prinzipien der biologischen Evolution”, problemata frommann-holzboog, Stuttgart, 1973

    Google Scholar 

  7. J. H. Holland: ”Adaption in Natural and Artificial Systems”, The University of Michigan Press, Ann Arbor, 1975

    Google Scholar 

  8. J. Heistermann, M. Hulin, P. Istavrinos, N. K. Gupta: ”Partitionierung digitaler Schaltungen auf vorgegebene physikalische Einheiten”, Informatik Forschung und Entwicklung (1988) 3

    Google Scholar 

  9. E. Jantsch: ”Die Selbstorganisation des Universums”, Carl Hanser Verlag, München, 1979

    Google Scholar 

  10. J. Hofbauer, K. Sigmund: ”Evolutionstheorie und dynamische Systeme”, Verlag Paul Parey, Berlin, 1984

    Google Scholar 

  11. M. Eigen: ”Stufen zum Leben”, Piper Verlag, München, 1987

    Google Scholar 

  12. C. M. Fiduccia, R. M. Mattheyses: ”A Linear-Time Heuristic for Improving Network Partitions”, Proc. 19th Design Aut. Conf., 1982, pp. 175–181

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hulin, M. (1991). Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029734

Download citation

  • DOI: https://doi.org/10.1007/BFb0029734

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54148-6

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics