 |
 |
5th Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA) July 11-15, 2015 @ GECCO 2015 in Madrid, Spain http://web.mst.edu/~tauritzd/ECADA/ *** SUBMISSION DEADLINE EXTENDED TO APRIL 8th 2015 *** CALL FOR PAPERS The ECADA workshop explores the Automated Design of Algorithms employing hyper-heuristics which are meta-heuristics applied to algorithm space, with an emphasis on hyper-heuristics of the evolutionary computation persuasion. Genetic Programming has most famously been employed to this end, but random search and iterative hill-climbing have both also successfully been employed to automatically design novel (components of) algorithms. These methods have the advantage of producing solutions that are applicable to any instance of a specified problem domain, instead of a solution specifically produced for a single problem instance. This is particularly useful for real-world problem solving where one can afford a large amount of a priori computational time to subsequently solve many problem instances drawn from a specified problem domain. The areas of application of these methods include, for instance, data mining, machine learning, optimization, bioinformatics, image processing, economics, cyber security, critical infrastructure protection, etc. The workshop welcomes original submissions on all aspects of Evolutionary Computation for the Automated Design of Algorithms, which include - but are not limited to - the following topics and themes: - Hyper-heuristics, in particular of the evolutionary computation persuasion, for designing a particular type of algorithm/heuristic for anything from optimization to machine learning to bioinformatics, etc. - Hyper-heuristics, in particular of the evolutionary computation persuasion, for designing other algorithms of the evolutionary computation persuasion (effectively Meta-Evolutionary Algorithms). - Empirical comparison of different hyper-heuristics. - Theoretical analyses of hyper-heuristics. - Automatic selection/creation of algorithm primitives (i.e., building blocks) as a preprocessing step for the use of hyper-heuristics. - Analysis of the trade-off between generality and effectiveness of different hyper-heuristics or of algorithms produced by a hyper-heuristic. - Analysis of the most effective representations for hyper-heuristics (e.g., Koza style Genetic Programming versus Cartesian Genetic Programming). - Real-world applications of hyper-heuristics. For more detailed information, see the ECADA workshop website (http://web.mst.edu/~tauritzd/ECADA/). IMPORTANT DATES Workshop paper submission deadline: April 8, 2015 Notification of acceptance: April 25, 2015 Camera-ready deadline: May 4, 2015 Registration deadline: May 4, 2015 PAPER SUBMISSION Submitted papers may not exceed 8 pages and are required to be in compliance with the GECCO 2015 Call for Papers Preparation Instructions. However, note that the review process of the workshop is not double-blind; hence, authors' information should be included in the paper. To submit, E-mail papers to: [log in to unmask]<mailto:[log in to unmask]> and [log in to unmask]<mailto:[log in to unmask]> All accepted papers will be presented at the workshop and appear in the GECCO Conference Companion Proceedings published by ACM. WORKSHOP SCHEDULE This will be a quarter-day workshop. The schedule will be announced on the workshop website shortly after the paper acceptance notification deadline. ORGANIZERS & CONTACT INFO Daniel Tauritz ([log in to unmask]<mailto:[log in to unmask]>) John Woodward ([log in to unmask]<mailto:[log in to unmask]>) WORKSHOP WEBSITE http://web.mst.edu/~tauritzd/ECADA/