Overcoming barriers by a cluster-moving genetic algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Overcoming barriers by a cluster-moving genetic algorithm

Full text

Pdf (81 KB)

Source

Genetic And Evolutionary Computation Conference archive
Proceedings of the 9th annual conference on Genetic and evolutionary computation table of contents

London, England

POSTER SESSION: Genetic algorithms: posters table of contents

Pages: 1520 - 1520

Year of Publication: 2007

ISBN:978-1-59593-697-4

Authors

Inwook Hwang	Seoul National University, Seoul, South Korea
Yong-Hyuk Kim	Kwangwoon University, Seoul, South Korea
Byung-Ro Moon	Seoul National University, Seoul, South Korea

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 19, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276958.1277249 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Kim, J. P., and Moon, B. R. A hybrid genetic search for multi-way graph partitioning based on direct partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (2001), pp. 408--415.

INDEX TERMS

Primary Classification:
G. Mathematics of Computing
G.1 NUMERICAL ANALYSIS
G.1.6 Optimization