ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

SMCGP2: finding algorithms that approximate numerical constants using quaternions and complex numbers

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Simon Harding Memorial University, St John's, Canada
Julian F. Miller University of York, York, United Kingdom
Wolfgang Banzhaf Memorial University, St John's, Canada
Published in:
Cover Image
 
· Proceeding
GECCO '11 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0690-4 doi>10.1145/2001858.2001968
SMCGP2: finding algorithms that approximate numerical constants using quaternions and complex numbers Published by ACM 2011 Article
  • Poster
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 29
· Citation Count: 1


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 © 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