The Hamming metric in genetic algorithms and its application to two network problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Hamming metric in genetic algorithms and its application to two network problems

Full text

Pdf (383 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice table of contents

Indianapolis, Indiana, United States

Pages: 126 - 130

Year of Publication: 1993

ISBN:0-89791-567-4

Authors

William G. Frederick	Indiana Univ.-Purdue Univ., Fort Wayne, IN
Robert L. Sedlmeyer	Indiana Univ.-Purdue Univ., Fort Wayne, IN
Curt M. White	Indiana Univ.-Purdue Univ., Fort Wayne, IN

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 16, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/162754.162835 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.

	1	Bagga K~mwarjit $., Beineke, Lowell W., Lipman, Marc l., Pi~ Raymond E., and Sedlmeyer, Robert L., "A good algoritlnn for the computation of the edge-integrity of trees," Congressus Numerantium 67 (1988~ 225-232.
	2	James E. Baker, Reducing bias and inefficiency in the selection algorithm, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, p.14-21, October 1987, Cambridge, Massachusetts, United States
	3	Davis, Lawrence, Handbook of Genetic Algofi.~, Van Nostrand Reinhold, 1991.
	4	Kenneth Alan De Jong, An analysis of the behavior of a class of genetic adaptive systems., 1975
	5	Fellows, M.R. and Stueckle, S., "The immersion order, forbiddnl subgraphs and the complexity of network integrity," 1. Combin. Math. Comb. Comput. (to appear).
	6	Frederick, William G., 'The Single Crossover Operator and Hamming Distance in Genetic Algorithms," (unpublished).
	7	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	8	Harary, Frank, C. naph ~r,/, Addison-Wesley Publishing Company, 1972.
	9	White, Curt M. and Frederick, William G., "Genetic algorithms and a variation on the Steiner Point problem," Proceedings of the Fourth Conference on Neural Networks and Par~lel Distribu,_t~_ Processing;, Fort Wayne, IN, April 199i.