A new and efficient partitioning algorithm: genetic partitioning
暂无分享,去创建一个
[1] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[2] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[5] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[6] James P. Cohoon,et al. Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[7] Reinhard Männer,et al. Optimization of Steiner Trees Using Genetic Algorithms , 1989, International Conference on Genetic Algorithms.
[8] Pinaki Mazumder,et al. A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] John J. Grefenstette,et al. Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.
[10] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[11] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[12] Kenneth de Jong,et al. Adaptive System Design: A Genetic Approach , 1980, IEEE Trans. Syst. Man Cybern..
[13] Michael P. Fourman,et al. Compaction of Symbolic Layout Using Genetic Algorithms , 1985, ICGA.
[14] John J. Grefenstette,et al. Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.