SIGN IN
SIGN UP
Problem difficulty analysis for particle swarm optimization: deception and modality
Full Text:
PDF
Buy this Article
Authors:
Bin Xin
Department of Automatic Control, Beijing Institute of Technology, Beijing, China
Jie Chen
Department of Automatic Control, Beijing Institute of Technology, Beijing, China
Feng Pan
Department of Automatic Control, Beijing Institute of Technology, Beijing, China
Published in:
· Proceeding
GEC '09
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Pages 623-630
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-326-6
doi>
10.1145/1543834.1543919
2009 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 21
· Downloads (cumulative): 182
· 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:
global optimization
heuristic methods
particle swarm optimization
performance
problem hardness
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