massivedatasets.wordpress.com
Archive 2011 | Algorithms for Massive Data Sets
https://massivedatasets.wordpress.com/archive-2011
Algorithms for Massive Data Sets. State-of-the-art algorithmic techniques and models for massive data sets. The course cover 3 major topics:. Time complexity analysis of randomized search heuristics. Monday 8.15- 10. Building 308, auditorium 11. Group exercises in building 322, room 033. The weekplan is preliminary. Part I: Advanced Data Structures. Week 1: Introduction and Hashing: Chained, Universal, and Perfect. J Carter and M. Wegman, Universal Classes of Hash Functions. J Comp. Sys. Sci. J ACM, 1984.
sigevo.org
GECCO 2012
http://www.sigevo.org/gecco-2012/tutorials.html
Two days of free tutorials and workshops (included with conference registration) presented by some of. The world’s foremost experts in topics of interest to genetic and evolutionary computation researchers and practitioners. Una-May O’Reilly -. Evolution Strategies: Basic Introduction. Thomas Bäck -. Evolutionary Computation: A unified view. Kenneth De Jong -. Probabilistic Model-building Genetic Algorithms. Evolution Strategies and CMA-ES (Covariance Matrix Adaptation). Anne Auger and -. Algorithm and E...
cs.adelaide.edu.au
Computer Science: Frank Neumann
http://cs.adelaide.edu.au/~frank
The University of Adelaide. School of Computer Science. Ingkarni Wardli, Office 4.55. The University of Adelaide. Adelaide, SA 5005, Australia. Phone: 61 8 8313 4477. Email: frank@cs.adelaide.edu.au. Group leader of Optimisation and Logistics. Application deadline 15 February 2016). F Neumann, C. Witt (2010):. Bioinspired Computation in Combinatorial Optimization. Algorithms and Their Computational Complexity. Natural Computing Series, Springer, ISBN 978-3-642-16543-6. Original publication at Springer.
