Applications of Evolutionary Computation: EvoApplications 2011: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Torino, Italy, April 27-29, 2011, Proceedings, Part 1Cecilia Di Chio, Stefano Cagnoni, Carlos Cotta, Marc Ebner, Aniko Ekart, Anna I. Esparcia-Alcázar, Juan J. Merelo, Ferrante Neri, Mike Preuss, Hendrik Richter, Julian Togelius, Georgios N. Yannakakis This book constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2011, held in Torino, Italy, in April 2011 colocated with the Evo* 2011 events. Thanks to the large number of submissions received, the proceedings for EvoApplications 2011 are divided across two volumes (LNCS 6624 and 6625). The present volume contains contributions for EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC. The 36 revised full papers presented were carefully reviewed and selected from numerous submissions. This volume presents an overview about the latest research in EC. Areas where evolutionary computation techniques have been applied range from telecommunication networks to complex systems, finance and economics, games, image analysis, evolutionary music and art, parameter optimization, scheduling, and logistics. These papers may provide guidelines to help new researchers tackling their own problem using EC. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
actions adaptive agent algorithm analysis applied approach average behaviour better combination compared complex Computation considered consists corresponding created defined described distance distribution dynamic effect environment evaluation Evolution Evolutionary Evolutionary Computation evolved example experiments Figure final fitness function Genetic given global Heidelberg heuristic IEEE implementation improved increase individuals initial instances Intelligence introduced Italy landscape learning LNCS means measure method move mutation needed nodes objective observed obtained operator optimization parameters particle performance player playing points population position possible presented probability problem Proceedings proposed random replacement represent respectively robot rules sampling schemes segmentation selection simulations single solutions solve space Springer standard step strategy structure Table techniques tion tournament track tree units University values variable