SIGN IN
SIGN UP
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
Full Text:
PDF
Buy this Article
Authors:
Per Kristian Lehre
The University of Birmingham, Birmingham, United Kingdom
Xin Yao
The University of Birmingham, Birmingham, United Kingdom
Published in:
· Proceeding
FOGA '09
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Pages 47-58
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-414-0
doi>
10.1145/1527125.1527133
2009 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 36
· Downloads (cumulative): 146
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
branching processes
computations on discrete structures
evolutionary algorithms
probabilistic algorithms
runtime analysis
theory
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