Fuzzy bi- and multi-partitioning for circuits represented by hypergraphs

Journal of Circuits, Systems and Computers

Volumn 6, Issue 5, 1996, Pages 503-526

  Ball, Carsten F ^a   Mlynski, Dieter A ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042982496     PISSN: 02181266     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218126696000340     Document Type: Article

References (24)

1. L. A. Zadeh, Fuzzy Sets and Applications, Selected Papers, Wiley & Sons, New York, 1987.
2. H. J. Zimmermann, Fuzzy Set Theory and its Applications, Kluwer Academic Publishers, Boston, 1991.
3. J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum Press, New York, 1981.
4. J. J. Hopfield and D.W. Tank, "Neural computation of decisions in optimization problems", Biological Cybernetics 52, 3 (1985) 141-152.
5. B. Levy and M. Adams, "Global optimization with stochastic neural networks", in Proc. IEEE Int. Conf. on Neural Networks, 1987, pp. III:681-689.
6. G. E. Hinton, T. J. Sejnowski, and D. H. Ackley, "Boltzmann machines: Constraint satisfaction networks that learn", Technical Report CMU-CS-84-119, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, May 1984.
7. J. Ramanujam and P. Sadayappan, "Optimization by neural networks", in Proc. IEEE Int. Conf. on Neural Networks, 1987, pp. II:325-332.
8. J. Hertz, A. Krough, and R. G. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley, 1991.
9. J. M. Zurada, Artificial Neural Systems, West Publishing Company, St. Paul, 1992.
10. M. K. Unaltuna and V. Pitchumani, "A stochasic reward and punishment neural network algorithm for circuit bipartitioning", in Proc. IEEE Int. Symp. on Circuits and Systems, 1994, pp. 181-184.
11. D. E. Van den Bout and T. K. Miller, "Graph partitioning using annealed neural networks", IEEE Trans. Neural Networks, 1, 2 (1990) 192-203.
12. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide of NP-Completeness, W. H. Freeman, New York, 1979.
13. H. Haken, Synergetics, An Introduction, Springer-Verlag, Berlin, 1988.
14. F. Reif, Fundamentals of Statistical and Thermal Physics, McGraw-Hill, New York, 1965.
15. J. W. Negele and H. Orland, Quantum Many-Particle Systems, Addison-Wesley, Redwood City, 1988.
16. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs", Bell Syst. Tech. J. (1970) 291-307.
17. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions", in ACM/IEEE Proc. 19th Design Automation Conf., 1982, pp. 175-181.
18. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing", Science 220 (1983) 671-680.
19. S. Nahar and E. Shragowitz, "Simulated annealing and combinatorial optimization", in ACM/IEEE Proc. 23rd Design Automation Conf., 1986, pp. 293-299.
20. D. G. Schweikert and B. W. Kernighan, "A proper model for the partitioning of electrical circuits", in Proc. 9th Design Automation Workshop, 1972, pp. 57-62.
21. L. Hagen and A. B. Kahng, "New spectral methods for ratio cut partitioning and clustering", IEEE Trans. Computer-Aided Design 11, 9 (1992) 1074-1085.
22. J. Kleinhans, F. M. Johannes, and K. J. Antreich, "GORDIAN: VLSI placement by quadratic programming and slicing optimization", IEEE Trans. Computer-Aided Design 10, 3 (1991) 356-365.
23. Y. Wei and C. Cheng, "Ratio cut partitioning for hierarchical designs", IEEE Trans. Computer-Aided Design 10, 7 (1991) 911-921.
24. A. G. Hoffmann, "The dynamik locking heuristic - a new graph partitioning algorithm", in Proc. IEEE Int. Symp. on Circuits and Systems, 1994, pp. 173-176.