Walsh and Haar functions in genetic algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Walsh and Haar functions in genetic algorithms

Full text

Pdf (425 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1994 ACM symposium on Applied computing table of contents

Phoenix, Arizona, United States

Pages: 201 - 205

Year of Publication: 1994

ISBN:0-89791-647-6

Author

Sami Khuri

Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA

Sponsors

SIGAPL: ACM Special Interest Group on APL Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/326619.326722 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	Alexits, G., (1961 ), Convergence Problems of Orthogonal Series, Pergammon, New York and London.
	2	Beauchamp K. G., (1984), Applications of Walsh and Related Functions, Academic Press.
	3	Albert Donally Bethke, Genetic algorithms as function optimizers, 1980
	4	Goldberg. D. E., (1989), Genetic Agorithms and Walsh Functions: Port I,A Gentle Introduction, Complex Systems 3:129-152.
	5	Goldbcrg. D.E.. (1989). Genetic Algorithms and Walsh Ftmctiotts Part ll: Deception attd its Analysis, Complex Systems 3. pp. 153-171.
	6	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	7	Ham', A.. ( 1910), Zttr Theorie der Orthogonalen Funk- /iottensysteme, Malh. Annalen 69:331-371.
	8	Harmulh, H. F'., (1968), A Generalized Concept of Frequet~{'y a~td Some Applications, IEEE Transactions on Informmion Theory, iT-14:375-382.
	9	John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
	10	Mark G. Karpovsky, Spectral Techniques and Fault Detection, Academic Press, Inc., Orlando, FL, 1985
	11	Krcmcr, H., (1973), Ott Theory ofFast Walsh Tramvform Al?ori/hms, Colloquium on the Theory and Applications of Walsh and Other Non-Sinusoidal Functions, Hallicld. U.K.
	12	Roeser, P. R/, and Jcrnigan, M. E., (1982), Fast Haar 7}'att.x;tbt'm A!.oorithms, {EEE Transactions on Computers C-31 no 2: 175-177.
	13	Shanks. J. L., (1969), Computation of the Fast Walsh- Fourier Transform. IEEE Trans,qclions on Computers C-18:457-459.
	14	Walsh, J.L., (1923). A Closed Set of Orthogonal Functious. Ann. J. Malh. 55'5-24.

CITED BY 2

	Sami Khuri, Computing with Haar functions, Proceedings of the 1997 ACM symposium on Applied computing, p.223-227, April 1997, San Jose, California, United States
	Hillol Kargupta , Byung-hoon Park, Gene Expression and Fast Construction of Distributed Evolutionary Representation, Evolutionary Computation, v.9 n.1, p.43-69, January 2001