Linkage learning using the maximum spanning tree of the dependency graph

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: B. Hoda Helmi University of Missouri at St. Louis, St Louis, MO, USA
Martin Pelikan University of Missouri at St. Louis, St Louis, MO, USA
Adel T. Rahmani Iran University of Science and Technology, Tehran, Iran
Published in:
Cover Image
 
· Proceeding
GECCO Companion '12 Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion
Pages 1429-1430
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1178-6 doi>10.1145/2330784.2330970
Linkage learning using the maximum spanning tree of the dependency graph Published by ACM 2012 Article
  • Poster
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 21
· Downloads (cumulative): 21
· Citation Count: 0


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