Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets

doi:10.1145/1068009.1068220

SIGN IN SIGN UP

Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets

Full Text:

PDF

Buy this Article

Authors:	M. T. Iglesias	Universidade da Coruña, A Coruña, Spain
	B. Naudts	Universiteit Antwerpen, Antwerp, Belgium
	A. Verschoren	Universiteit Antwerpen, Antwerp, Belgium
	C. Vidal	Universidade da Coruña, A Coruña, Spain

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 2 · Citation Count: 2

Published in:

· Proceeding

GECCO '05 Proceedings of the 2005 conference on Genetic and evolutionary computation

ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-010-8 doi>10.1145/1068009.1068220

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- GECCO '12

Share:

|

Tags: algorithms genetic algorithm multary alphabet nonnumerical algorithms and problems partition coefficient problem solving, control methods, and search schema average schema theory theory walsh coefficient walsh function

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder