SIGN IN
SIGN UP
Estimating the destructiveness of crossover on binary tree representations
Full Text:
PDF
Buy this Article
Authors:
Luke Sheneman
University of Idaho, Moscow, ID
James A. Foster
University of Idaho, Moscow, ID
Published in:
· Proceeding
GECCO '06
Proceedings of the 8th annual conference on Genetic and evolutionary computation
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-186-4
doi>
10.1145/1143997.1144228
2006 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Citation Count: 1
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
crossover
design
destructiveness
graph and tree search strategies
performance
robinson-foulds
trees
trees
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder