On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Carlos D. Toledo-Suárez Instituto Tecnológico y de Estudios Superiores de Monterrey
Manuel Valenzuela-Rendón Instituto Tecnológico y de Estudios Superiores de Monterrey
Hugo Terashima-Marín Instituto Tecnológico y de Estudios Superiores de Monterrey
Eduardo Uresti-Charre Instituto Tecnológico y de Estudios Superiores de Monterrey
On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 17
· Downloads (cumulative): 126
· Citation Count: 1

Published in:
· Proceeding
GECCO '07 Proceedings of the 9th annual conference on Genetic and evolutionary computation
Pages 1436-1443
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-697-4 doi>10.1145/1276958.1277222

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 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