New solutions to the mapping problem of parallel systems: The evolution approach
暂无分享,去创建一个
Heinz Mühlenbein | Martina Gorges-Schleuter | Ottmar Krämer | H. Mühlenbein | M. Gorges-Schleuter | Ottmar Krämer
[1] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[2] R. Brady. Optimization strategies gleaned from biological evolution , 1985, Nature.
[3] Lawrence Bodin,et al. Approximate Traveling Salesman Algorithms , 1980, Oper. Res..
[4] Patrick D. Krolak,et al. A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.
[5] Heinz Mühlenbein,et al. Mapping strategies in message-based multiprocessor systems , 1989, Parallel Comput..
[6] Hans-Michael Voigt,et al. Pattern Formation by Natural Selection with Applications to Decision Support , 1986 .
[7] E. Barnes. An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[8] T. Liebling,et al. Probabilistic exchange algorithms and Euclidean traveling salesman problems , 1986 .
[9] Heinz Mühlenbein,et al. MUPPET: a programming environment for message-based multiprocessors , 1986, Parallel Comput..
[10] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[11] Pierre-Jacques Courtois,et al. On time and space decomposition of complex structures , 1985, CACM.