ACM Home Page
Please provide us with feedback. Feedback
Binary particle swarm optimization: a forma analysis approach
Full text PdfPdf (51 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 9th annual conference on Genetic and evolutionary computation table of contents
London, England
POSTER SESSION: Ant colony optimization, swarm intelligence, and artificial immune systems: posters table of contents
Pages: 172 - 172  
Year of Publication: 2007
ISBN:978-1-59593-697-4
Authors
Tao Gong  City University of London, London, United Kingdom
Andrew L Tuson  City University of London, London, United Kingdom
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 69,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276958.1276986
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Kennedy and R. Eberhart. Particle swarm optimization. In IEEE International Conference on Neural Networks, Perth, Australia, 1995.
 
2
N. Radcliffe. The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence, 10:339--384, 1994.


Collaborative Colleagues:
Tao Gong: colleagues
Andrew L Tuson: colleagues