@inbook {39,
	title = {Tutorials at PPSN 2016},
	booktitle = {Parallel Problem Solving from Nature {\textendash} PPSN XIV: 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings},
	year = {2016},
	pages = {1012{\textendash}1022},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {PPSN 2016 hosts a total number of 16 tutorials covering a broad range of current research in evolutionary computation. The tutorials range from introductory to advanced and specialized but can all be attended without prior requirements. All PPSN attendees are cordially invited to take this opportunity to learn about ongoing research activities in our field!},
	isbn = {978-3-319-45823-6},
	doi = {10.1007/978-3-319-45823-6_95},
	url = {http://dx.doi.org/10.1007/978-3-319-45823-6_95},
	author = {Doerr, Carola and Bredeche, Nicolas and Alba, Enrique and Bartz-Beielstein, Thomas and Brockhoff, Dimo and Doerr, Benjamin and Eiben, Gusz and Epitropakis, Michael G. and Fonseca, Carlos M. and Guerreiro, Andreia and Haasdijk, Evert and Heinerman, Jacqueline and Hubert, Julien and Lehre, Per Kristian and Malag{\`o}, Luigi and Merelo, J. J. and Miller, Julian and Naujoks, Boris and Oliveto, Pietro and Picek, Stjepan and Pillay, Nelishia and Preuss, Mike and Ryser-Welch, Patricia and Squillero, Giovanni and Stork, J{\"o}rg and Sudholt, Dirk and Tonda, Alberto and Whitley, Darrell and Zaefferer, Martin},
	editor = {Handl, Julia and Hart, Emma and Lewis, Peter R. and L{\'o}pez-Ib{\'a}{\~n}ez, Manuel and Ochoa, Gabriela and Paechter, Ben}
}
@article {32,
	title = {Gen-O-Fix: An embeddable framework for Dynamic Adaptive Genetic Improvement Programming},
	number = {CSM-195},
	year = {2014},
	month = {01/2014},
	pages = {1-12},
	institution = {Computing Science and Mathematics, University of Stirling},
	address = {Stirling FK9 4LA, Scotland},
	abstract = {Genetic Improvement Programming (GIP) is concerned with automating the burden of software maintenance, the most costly phase of the software lifecycle. We describe Gen-O-Fix, a GIP framework which allows a software system hosted on the Java Virtual Machine to be continually improved (e.g. make better predictions; pass more regression tests; reduce power consumption). It is the first exemplar of a dynamic adaptive GIP framework, i.e. it can improve a system as it runs. It is written in the Scala programming language and uses reflection to yield source-to-source transformation. One of the design goals for Gen-O-Fix was to create a tool that is user-centric rather than researcher-centric: the end-user is required only to provide a measure of system quality and the URL of the source code to be improved. We discuss potential applications to predictive, embedded and high-performance systems.},
	author = {Jerry Swan and Michael G. Epitropakis and John R. Woodward}
}
@inbook {41,
	title = {Repairing and Optimizing Hadoop hashCode Implementations},
	booktitle = {Search-Based Software Engineering: 6th International Symposium, SSBSE 2014, Fortaleza, Brazil, August 26-29, 2014. Proceedings},
	year = {2014},
	pages = {259{\textendash}264},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {We describe how contract violations in Java TM hashCode methods can be repaired using novel combination of semantics-preserving and generative methods, the latter being achieved via Automatic Improvement Programming. The method described is universally applicable. When applied to the Hadoop platform, it was established that it produces hashCode functions that are at least as good as the original, broken method as well as those produced by a widely-used alternative method from the {\textquoteleft}Apache Commons{\textquoteright} library.},
	isbn = {978-3-319-09940-8},
	doi = {10.1007/978-3-319-09940-8_22},
	url = {http://dx.doi.org/10.1007/978-3-319-09940-8_22},
	author = {Kocsis, Zoltan A. and Neumann, Geoff and Swan, Jerry and Epitropakis, Michael G. and Brownlee, Alexander E. I. and Haraldsson, Sami O. and Bowles, Edward},
	editor = {Le Goues, Claire and Yoo, Shin}
}
@conference {13,
	title = {Weighted Markov Chain Model for Musical Composer Identification},
	booktitle = {Applications of Evolutionary Computation},
	year = {2011},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Several approaches based on the {\textquoteleft}Markov chain model{\textquoteright} have been proposed to tackle the composer identification task. In the paper at hand, we propose to capture phrasing structural information from inter onset and pitch intervals of pairs of consecutive notes in a musical piece, by incorporating this information into a weighted variation of a first order Markov chain model. Additionally, we propose an evolutionary procedure that automatically tunes the introduced weights and exploits the full potential of the proposed model for tackling the composer identification task between two composers. Initial experimental results on string quartets of Haydn, Mozart and Beethoven suggest that the proposed model performs well and can provide insights on the inter onset and pitch intervals on the considered musical collection.},
	doi = {10.1007/978-3-642-20520-0_34},
	author = {M. A. Kaliakatsos-Papakostas and M. G. Epitropakis and M. N. Vrahatis},
	editor = {Di Chio, Cecilia and Brabazon, Anthony and Di Caro, Gianni and Drechsler, Rolf and Farooq, Muddassar and Grahl, J{\"o}rn and Greenfield, Gary and Prins, Christian and Romero, Juan and Squillero, Giovanni and Tarantino, Ernesto and Tettamanzi, Andrea and Urquhart, Neil and Uyar, A.}
}
