SIGN IN
SIGN UP
Apply ant colony optimization to Tetris
Full Text:
PDF
Buy this Article
Authors:
Xingguo Chen
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing , China
Hao Wang
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
Weiwei Wang
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing , China
Yinghuan Shi
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
Yang Gao
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
2009 Article
Poster
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 27
· Downloads (cumulative): 203
· Citation Count: 0
Published in:
· Proceeding
GECCO '09
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Pages 1741-1742
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-325-9
doi>
10.1145/1569901.1570136
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '13
Share:
|
Tags:
ant colony optimization
experimentation
markov processes
reinforcement learning
tetris
weight graph
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