ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Using multiple offspring sampling to guide genetic algorithms to solve permutation problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Antonio LaTorre Universidad Politécnica de Madrid, Madrid, Spain
José M. Peña Universidad Politécnica de Madrid, Madrid, Spain
Victor Robles Universidad Politécnica de Madrid, Madrid, Spain
Santiago Muelas Universidad Politécnica de Madrid, Madrid, Spain
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems Published by ACM 2008 Article
  • Poster
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 21
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
GECCO '08 Proceedings of the 10th annual conference on Genetic and evolutionary computation
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-130-9 doi>10.1145/1389095.1389307

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