SIGN IN
SIGN UP
Some theoretical results about the computation time of evolutionary algorithms
Full Text:
PDF
Buy this Article
Authors:
Lixin Ding
Wuhan University, Wuhan, P. R. China
Jinghu Yu
Chinese Academy of Sciences, Wuhan, P. R. China
Published in:
· Proceeding
GECCO '05 Proceedings of the 2005 conference on Genetic and evolutionary computation
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-010-8
doi>
10.1145/1068009.1068234
2005 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 10
· Citation Count: 2
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
computation time
drift analysis
dynkin's formula
evolutionary algorithms
miscellaneous
problem solving, control methods, and search
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