A Hybrid Genetic Search for Graph Partitioning Based on Lock Gain
暂无分享,去创建一个
[1] Shantanu Dutt,et al. A probability-based approach to VLSI circuit partitioning , 1996, DAC '96.
[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[3] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[4] Andrew B. Kahng,et al. Improved Large-Step Markov Chain Variants for the Symmetric TSP , 1997, J. Heuristics.
[5] Dana S. Richards,et al. A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes , 1991, ICGA.
[6] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[7] Jean-Michel Renders,et al. Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[8] Kishan G. Mehrotra,et al. Genetic algorithms for graph partitioning and incremental graph partitioning , 1994, Proceedings of Supercomputing '94.
[9] L. Darrell Whitley,et al. Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.
[10] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[11] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[12] Youssef Saab,et al. Stochastic evolution: a fast effective heuristic for some generic layout problems , 1991, DAC '90.
[13] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[14] Roberto Battiti,et al. Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.
[15] Curt Jones. Vertex and edge partitions of graphs , 1992 .
[16] A. G. Steenbeek,et al. Finding balanced graph bi-partitions using a hybrid genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[17] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[18] Curt Jones,et al. Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..
[19] Bernd Freisleben,et al. Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem , 1998, PPSN.
[20] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[21] Gregor von Laszewski,et al. Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.
[22] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[23] Byung Ro Moon,et al. Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.
[24] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[25] David R. Jefferson,et al. Selection in Massively Parallel Genetic Algorithms , 1991, ICGA.
[26] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[27] David E. Goldberg,et al. Decision making in a hybrid genetic algorithm , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[28] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[29] Darrell Whitley,et al. Genitor: a different genetic algorithm , 1988 .