Extremal optimization: Heuristics via coevolutionary avalanches

Computing in Science and Engineering

Volumn 2, Issue 6, 2000, Pages 75-82

  Boettcher, Stefan ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008022281     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.881710     Document Type: Article

References (20)

1. C.R. Reeves, ed., Modern Heuristic Techniques for Combinatorial Problems, John Wiley & Sons, New York, 1993.
2. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, “Optimization by Simulated Annealing,” Science, Vol. 220, No. 4,598, May 1983, pp. 671-680.
3. S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 6, No. 6, Nov. 1984, pp. 721-741.
4. D.S. Johnson et al., “Optimization by Simulated Annealing: An Experimental Evaluation; Part 1, Graph Partitioning,” Operations Research, Vol. 37, No. 6, Nov. 1989, pp. 865-892.
5. S. Boettcher and A.G. Percus, “Nature's Way of Optimizing,” Artificial Intelligence, Vol. 119, Nos. 1-2, May 2000, pp. 275-286.
6. J. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan Press, Ann Arbor, Mich., 1975.
7. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Mass., 1989.
8. P. Bak, How Nature Works, Springer-Verlag, New York, 1996.
9. P. Bak and K. Sneppen, “Punctuated Equilibrium and Criticality in a Simple Model of Evolution,” Physical Rev. Letters, Vol. 71, No. 24, 13 Dec. 1993, pp. 4083-4086.
10. M. Newman, “Simple Models of Evolution and Extinction,” Computing in Science & Eng., Vol. 2, No. 1, Jan./Feb. 2000, pp. 80-86.
11. P. Bak, C. Tang, and K. Wiesenfeld, “Self-Organized Criticality: An Explanation of the 1/f Noise,” Physical Rev. Letters, Vol. 59, No. 4, 27 July 1987, pp. 381-384.
12. S. Boettcher and M. Paczuski, “Ultrametricity and Memory in a Solvable Model of Self-Organized Criticality,” Physical Rev. E, Vol. 54, No. 2, Aug. 1996, pp. 1082-1095.
13. S. Boettcher, “Extremal Optimization and Graph Partitioning at the Percolation Threshold,” J. Physics A: Mathematical and General, Vol. 32, No. 28, 16 July 1999, pp. 5201-5211.
14. P. Merz and B. Freisleben, Memetic Algorithms and The Fitness Landscape of the Graph Bi-Partitioning Problem, Lecture Notes in Computer Science, No. 1498, Springer-Verlag, Heidelberg, Germany, 1998, pp. 765-774.
15. B.A. Hendrickson and R. Leland, “A Multilevel Algorithm for Partitioning Graphs,” Proc. Supercomputing'95 (CD-ROM), IEEE Computer Soc. Press, Los Alamitos, Calif., 1995.
16. G. Karypis and V. Kumar, “METIS: Family of Multilevel Partitioning Algorithms,” wwwusers. cs.umn.edu/~karypis/metis/main.shtml.
17. P. Cheeseman, B. Kanefsky, and W.M. Taylor, “Where the Really Hard Problems Are,” Proc. 1991 Int'l Joint Conf. Artificial Intelligence (IJCAI '91), Morgan Kaufmann, San Francisco, 1991, pp. 331-337.
18. Special issue on Frontiers in Problem Solving: Phase Transitions and Complexity, Artificial Intelligence, Vol. 81, Nos. 1-2, Mar. 1996.
19. R. Monasson et al., “Determining Computational Complexity from Characteristic 'Phase Transitions,'” Nature, Vol. 400, No. 6,740, 8 July, 1999, pp. 133-137.
20. J. Machta and R. Greenlaw, “The Computational Complexity of Generating Random Fractals,” J. Statistical Physics, Vol. 82, Nos. 5-6, Mar. 1996, pp. 1299-1326.