GECCO 2011: Dublin, Ireland

Invited talks

• Rebecca Schulman:
  Beyond biology: designing a new mechanism for self-replication and evolution at the nanoscale. 7-14
  
• Steen Rasmussen, Anders Albertsen, Harold Fellermann, Pernille Lykke Pedersen, Carsten Svaneborg, Hans Ziock:
  Assembling living materials and engineering life-like technologies. 15-20
  

Ant colony optimization and swarm intelligence track papers

• Juan Rada-Vilela, Mengjie Zhang, Winston Seah:
  A performance study on synchronous and asynchronous updates in particle swarm optimization. 21-28
  
• Hongliang Liu, Enda Howley, Jim Duggan:
  Particle swarm optimisation with gradually increasing directed neighbourhoods. 29-36
  
• Mohammad Majid al-Rifaie, John Mark Bishop, Tim Blackwell:
  An investigation into the merger of stochastic diffusion search and particle swarm optimisation. 37-44
  
• Mahdi Setayesh, Mengjie Zhang, Mark Johnston:
  Detection of continuous, smooth and thin edges in noisy images using constrained particle swarm optimisation. 45-52
  
• Stephen Chen, James Montgomery:
  Selection strategies for initial positions and initial velocities in multi-optima particle swarms. 53-60
  
• Shannon S. Pace, Clinton Woodward:
  Diversity preservation using excited particle swarm optimisation. 61-68
  
• Saúl Zapotecas Martínez, Carlos A. Coello Coello:
  A multi-objective particle swarm optimizer based on decomposition. 69-76
  
• Wenlong Fu, Mark Johnston, Mengjie Zhang:
  Hybrid particle swarm optimisation based on history information sharing. 77-84
  
• Chunhe Song, Hai Zhao, Wei Jing, Hongbo Zhu:
  PSO based motion deblurring for single image. 85-92
  
• Konrad Diwold, Daniel Himmelbach, René Meier, Carsten Baldauf, Martin Middendorf:
  Bonding as a swarm: applying bee nest-site selection behaviour to protein docking. 93-100
  
• Yannis Marinakis, Magdalene Marinaki:
  A honey bees mating optimization algorithm for the open vehicle routing problem. 101-108
  
• Mohammed El-Abd:
  Opposition-based artificial bee colony algorithm. 109-116
  
• Christian Domínguez-Medina, Nareli Cruz Cortés:
  Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networks. 117-124
  
• Tianjun Liao, Marco Antonio Montes de Oca, Dogan Aydin, Thomas Stützle, Marco Dorigo:
  An incremental ant colony algorithm with local search for continuous optimization. 125-132
  
• Ying Lin, Jing-Hui Zhong, Jun Zhang:
  Parallel exploitation in estimated basins of attraction: a new derivative-free optimization algorithm. 133-138
  
• Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
  An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions. 139-146
  
• José García-Nieto, Enrique Alba:
  Empirical computation of the quasi-optimal number of informants in particle swarm optimization. 147-154
  
• Wei-neng Chen, Jun Zhang:
  Ant colony optimization for determining the optimal dimension and delays in phase space reconstruction. 155-162
  
• Dhananjay Raghavan Thiruvady, Bernd Meyer, Andreas T. Ernst:
  Car sequencing with constraint-based ACO. 163-170
  

Artificial life/robotics/evolvable hardware track papers

• Giorgos Karafotias, Evert Haasdijk, Ágoston E. Eiben:
  An algorithm for distributed on-line, on-board evolutionary robotics. 171-178
  
• Josh C. Bongard:
  Morphological and environmental scaffolding synergize when evolving robot controllers: artificial life/robotics/evolvable hardware. 179-186
  
• Evert Haasdijk, Arif Atta-ul-Qayyum, Ágoston E. Eiben:
  Racing to improve on-line, on-board evolutionary robotics. 187-194
  
• Heiko Hamann, Thomas Schmickl, Karl Crailsheim:
  Coupled inverted pendulums: a benchmark for evolving decentral controllers in modular robotics. 195-202
  
• Jacob Charles Walker:
  The evolution of optimal foraging strategies in populations of digital organisms. 203-210
  
• Joel Lehman, Kenneth O. Stanley:
  Evolving a diversity of virtual creatures through novelty search and local competition. 211-218
  
• Luis Zaman, Suhas Devangam, Charles Ofria:
  Rapid host-parasite coevolution drives the production and maintenance of diversity in digital organisms. 219-226
  
• Brian D. Connelly, Luis Zaman, Philip K. McKinley, Charles Ofria:
  Modeling the evolutionary dynamics of plasmids in spatial populations. 227-234
  
• Ben Jones, Andrea Soltoggio, Bernhard Sendhoff, Xin Yao:
  Evolution of neural symmetry and its coupled alignment to body plan morphology. 235-242
  
• Chad M. Byers, Betty H. C. Cheng, Philip K. McKinley:
  Digital enzymes: agents of reaction inside robotic controllers for the foraging problem. 243-250
  
• Josh C. Bongard:
  Spontaneous evolution of structural modularity in robot neural network controllers: artificial life/robotics/evolvable hardware. 251-258
  
• Tony Pinville, Sylvain Koos, Jean-Baptiste Mouret, Stéphane Doncieux:
  How to promote generalisation in evolutionary robotics: the ProGAb approach. 259-266
  
• Charles Ollion, Stéphane Doncieux:
  Why and how to measure exploration in behavioral space. 267-274
  
• Christian Roth, Matt Knudson, Kagan Tumer:
  Agent fitness functions for evolving coordinated sensor networks. 275-282
  

Bioinformatics, computational, systems, and synthetic biology track papers

• Fergal Reid, Neil J. Hurley:
  Analysing structure in complex networks using quality functions evolved by genetic programming. 283-290
  
• Mariana Recamonde Mendoza, Ana Lúcia C. Bazzan:
  Evolving random boolean networks with genetic algorithms for regulatory networks reconstruction. 291-298
  
• Nicholas E. Hardison, Alison A. Motsinger-Reif:
  The power of quantitative grammatical evolution neural networks to detect gene-gene interactions. 299-306
  
• Michael Douglas Schmidt, Hod Lipson:
  Automated modeling of stochastic reactions with large measurement time-gaps. 307-314
  
• Jirí Kubalík:
  Evolutionary-based iterative local search algorithm for the shortest common supersequence problem. 315-322
  
• Nazar Zaki, Fadi N. Sibai, Piers Campbell:
  Conotoxin protein classification using pairwise comparison and amino acid composition: toxin-aam. 323-330
  
• Roberto Santana, Concha Bielza, Pedro Larrañaga:
  Affinity propagation enhanced by estimation of distribution algorithms. 331-338
  
• Michaël Marcozzi, Federico Divina, Jesús S. Aguilar-Ruiz, Wim Vanhoof:
  A novel probabilistic encoding for EAs applied to biclustering of microarray data. 339-346
  
• Nazar Zaki, Salah Bouktif, Sanja Lazarova-Molnar:
  A genetic algorithm to enhance transmembrane helices prediction. 347-354
  

Digital entertainment technologies and arts track papers

• Krzysztof Krawiec, Marcin Grzegorz Szubert:
  Learning n-tuple networks for othello by coevolutionary gradient search. 355-362
  
• William L. Raffe, Fabio Zambetta, Xiaodong Li:
  Evolving patch-based terrains for use in video games. 363-370
  
• Igor Karpov, Vinod K. Valsalam, Risto Miikkulainen:
  Human-assisted neuroevolution through shaping, advice and examples. 371-378
  
• Jason Gauci, Kenneth O. Stanley:
  Evolving neural networks for geometric game-tree pruning. 379-386
  
• Amy K. Hoover, Paul A. Szerlip, Kenneth O. Stanley:
  Interactively evolving harmonies through functional scaffolding. 387-394
  
• Luigi Cardamone, Daniele Loiacono, Pier Luca Lanzi:
  Interactive evolution for the procedural generation of tracks in a high-end racing game. 395-402
  
• James McDermott, Una-May O'Reilly:
  An executable graph representation for evolutionary generative music. 403-410
  
• Igor Vatolkin, Mike Preuß, Günter Rudolph:
  Multi-objective feature selection in music genre and style recognition tasks. 411-418
  
• Alan R. R. de Freitas, Frederico Gadelha Guimarães:
  Originality and diversity in the artificial evolution of melodies. 419-426
  
• Eelco den Heijer, Ágoston E. Eiben:
  Evolving art with scalable vector graphics. 427-434
  

Evolutionary combinatorial optimization and metaheuristics track papers

• Dan Qaurooni:
  A memetic algorithm for course timetabling. 435-442
  
• Claudio Fabiano Motta Toledo, Márcio da Silva Arantes, Paulo Morelato França:
  Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem. 443-448
  
• Luís H. C. Bicalho, André Gustavo dos Santos, José Elias Claudio Arroyo:
  Metaheuristic for parallel machines scheduling with resource-assignable sequence dependent setup times. 449-456
  
• Malek Mouhoub, Bahareh Jafari Jashmi:
  Heuristic techniques for variable and value ordering in CSPs. 457-464
  
• David Chalupa:
  Population-based and learning-based metaheuristic algorithms for the graph coloring problem. 465-472
  
• Jin Kim, Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon:
  Genetic approaches for graph partitioning: a survey. 473-480
  
• Petrica C. Pop, Serban Iordache:
  A hybrid heuristic approach for solving the generalized traveling salesman problem. 481-488
  
• Rubén Ruiz-Torrubiano, Alberto Suárez:
  The TransRAR crossover operator for genetic algorithms with set encoding. 489-496
  
• Ahmed Kafafy, Ahmed Bounekkar, Stéphane Bonnevay:
  A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problems. 497-504
  
• Shaheen Fatima, Ahmed Kattan:
  Evolving optimal agendas for package deal negotiation. 505-512
  
• Malika Mehdi, Jean-Claude Charr, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
  A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems. 513-520
  
• Reza Abbasian, Malek Mouhoub:
  An efficient hierarchical parallel genetic algorithm for graph coloring problem. 521-528
  
• Darrell Whitley, Gabriela Ochoa:
  Partial neighborhoods of the traveling salesman problem. 529-536
  
• Nasser Tairan, Qingfu Zhang:
  P-GLS-II: an enhanced version of the population-based guided local search. 537-544
  
• A. K. Qin, Florence Forbes:
  Harmony search with differential mutation based pitch adjustment. 545-552
  
• Shu Liu, Hitoshi Iba:
  Imitation tendencies of local search schemes in baldwinian evolution. 553-560
  
• Aldeida Aleti, Irene Moser:
  Predictive parameter control. 561-568
  

Estimation of distribution algorithms track papers

• Jui-Ting Lee, Kai-Chun Fan, Tian-Li Yu:
  The essence of real-valued characteristic function for pairwise relation in linkage learning for EDAs. 569-576
  
• Petr Posík, Stanislav Vanícek:
  Parameter-less local optimizer with linkage identification for deterministic order-k decomposable problems. 577-584
  
• Rogelio Salinas-Gutiérrez, Arturo Hernández Aguirre, Enrique Raúl Villa Diharce:
  Dependence trees with copula selection for continuous estimation of distribution algorithms. 585-592
  
• Roberto Santana, Hossein Karshenas, Concha Bielza, Pedro Larrañaga:
  Regularized k-order markov models in EDAs. 593-600
  
• Xianneng Li, Shingo Mabu, Kotaro Hirasawa:
  Use of infeasible individuals in probabilistic model building genetic network programming. 601-608
  
• Josu Ceberio, Alexander Mendiburu, Jose Antonio Lozano:
  A preliminary study on EDAs for permutation problems based on marginal-based models. 609-616
  
• Dirk Thierens, Peter A. N. Bosman:
  Optimal mixing evolutionary algorithms. 617-624
  
• Mark Hauschild, Martin Pelikan:
  Advanced neighborhoods and problem difficulty measures. 625-632
  
• David Iclanzan:
  Hierarchical allelic pairwise independent functions. 633-640
  

Evolutionary multiobjective optimization track papers

• Tamara Ulrich, Lothar Thiele:
  Maximizing population diversity in single-objective optimization. 641-648
  
• Hisao Ishibuchi, Naoya Akedo, Yusuke Nojima:
  A many-objective test problem for visually examining diversity maintenance behavior in a decision space. 649-656
  
• Kiyoharu Tagawa, Hidehito Shimizu, Hiroyuki Nakamura:
  Indicator-based differential evolution using exclusive hypervolume approximation and parallelization for multi-core processors. 657-664
  
• Jing-Hui Zhong, Jun Zhang:
  Adaptive multi-objective differential evolution with stochastic coding strategy. 665-672
  
• James Montgomery, Marcus Randall, Andrew Lewis:
  Differential evolution for RFID antenna design: a comparison with ant colony optimisation. 673-680
  
• Kazi Shah Nawaz Ripon, Kashif Nizam Khan, Kyrre Glette, Mats Høvin, Jim Torresen:
  Using pareto-optimality for solving multi-objective unequal area facility layout problem. 681-688
  
• Edmondo A. Minisci, Massimiliano Vasile:
  Robust design of a re-entry unmanned space vehicle by multi-fidelity evolution control. 689-696
  
• Irina Harris, Christine L. Mumford, Mohamed M. Naim:
  An evolutionary bi-objective approach to the capacitated facility location problem with cost and CO₂ emissions. 697-704
  
• Christiane Regina Soares Brasil, Alexandre Cláudio Botazzo Delbem, Daniel Rodrigo Ferraz Bonetti:
  Investigating relevant aspects of MOEAs for protein structures prediction. 705-712
  
• Harold Soh, Yiannis Demiris:
  Evolving policies for multi-reward partially observable markov decision processes (MR-POMDPs). 713-720
  
• Maoguo Gong, Fang Liu, Wei Zhang, Licheng Jiao, Qingfu Zhang:
  Interactive MOEA/D for multi-objective decision making. 721-728
  
• Jing Sun, Dunwei Gong, Xiaoyan Sun:
  Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron. 729-736
  
• Tea Tusar, Bogdan Filipic:
  Visualizing 4D approximation sets of multiobjective optimizers with prosections. 737-744
  
• Karl Bringmann, Tobias Friedrich:
  Convergence of hypervolume-based archiving algorithms I: effectiveness. 745-752
  
• Hiroyuki Sato, Hernán E. Aguirre, Kiyoshi Tanaka:
  Improved S-CDAs using crossover controlling the number of crossed genes for many-objective optimization. 753-760
  
• Evan James Hughes:
  Many-objective directed evolutionary line search. 761-768
  
• Sébastien Vérel, Arnaud Liefooghe, Clarisse Dhaenens:
  Set-based multiobjective fitness landscapes: a preliminary study. 769-776
  
• Irene Moser, James Montgomery:
  Population-ACO for the automotive deployment problem. 777-784
  
• Juan Arturo Herrera Ortiz, Katya Rodríguez-Vázquez, Itza T. Q. Curiel Cabral, Sonia Di Giannatale Menegalli:
  A RankMOEA to approximate the pareto front of a dynamic principal-agent model. 785-792
  
• Taejin Park, Kwang Ryel Ryu:
  Accumulative sampling for noisy evolutionary multi-objective optimization. 793-800
  
• Olivier Teytaud:
  Comparison-based complexity of multiobjective optimization. 801-806
  
• Matthias W. Blesken, Anouar Chebil, Ulrich Rückert, Xavier Esquivel, Oliver Schütze:
  Integrated circuit optimization by means of evolutionary multi-objective optimization. 807-812
  

Evolution strategies and evolutionary programming track papers

• Steffen Finck, Hans-Georg Beyer, Alexander Melkozerov:
  Noisy optimization: a theoretical strategy comparison of ES, EGS, SPSA & IF on the noisy sphere. 813-820
  
• Simon Wessing, Mike Preuss, Günter Rudolph:
  When parameter tuning actually is parameter control. 821-828
  
• Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, Günter Rudolph:
  Exploratory landscape analysis. 829-836
  
• Mike Preuss, Catalin Stoean, Ruxandra Stoean:
  Niching foundations: basin identification on fixed-property generated landscapes. 837-844
  
• Tom Schaul, Tobias Glasmachers, Jürgen Schmidhuber:
  High dimensions and heavy tails for natural evolution strategies. 845-852
  
• Dirk V. Arnold:
  Analysis of a repair mechanism for the (1, λ)-ES applied to a simple constrained problem. 853-860
  
• Anne Auger, Dimo Brockhoff, Nikolaus Hansen:
  Mirrored sampling in evolution strategies with weighted recombination. 861-868
  
• Zyed Bouzarkouna, Anne Auger, Didier Yu Ding:
  Local-meta-model CMA-ES for partially separable functions. 869-876
  
• Johannes W. Kruisselbrink, Edgar Reehuis, André H. Deutz, Thomas Bäck, Michael Emmerich:
  Using the uncertainty handling CMA-ES for finding robust optima. 877-884
  
• Ilya Loshchilov, Marc Schoenauer, Michèle Sebag:
  Adaptive coordinate descent. 885-892
  

Genetic algorithms track papers

• Johannes W. Kruisselbrink, Rui Li, Edgar Reehuis, Jeroen Eggermont, Thomas Bäck:
  On the log-normal self-adaptation of the mutation rate in binary search spaces. 893-900
  
• Farhad Nadi, Ahamad Tajudin Abdul Khader:
  A parameter-less genetic algorithm with customized crossover and mutation operators. 901-908
  
• Maury M. Gouvea Jr., Aluizio F. R. Araújo:
  Adaptive evolutionary algorithm based on population dynamics for dynamic environments. 909-916
  
• Fernando G. Lobo:
  Idealized dynamic population sizing for uniformly scaled problems. 917-924
  
• Bernadete Maria de Mendonça Neta, Gustavo Henrique Diniz Araújo, Frederico Gadelha Guimarães, Renato Cardoso Mesquita:
  A multiobjective genetic algorithm for automatic orthogonal graph drawing. 925-932
  
• Lino A. Costa, Isabel A. Espírito-Santo, Pedro Oliveira:
  Stochastic algorithms assessment using performance profiles. 933-940
  
• Josafath Israel Espinosa Ramos, Roberto Antonio Vázquez Espinoza de los Monteros:
  Locating seismic-sense stations through genetic algorithm: genetic algorithms. 941-948
  
• Francisco Vasconcelos, Carlos Henggeler Antunes, João P. Barreto:
  Adaptive and hybrid genetic approaches for estimating the camera motion from image point correspondences. 949-956
  
• Brian G. Woolley, Kenneth O. Stanley:
  On the deleterious effects of a priori objectives on evolution and representation. 957-964
  
• Steijn Kistemaker, Shimon Whiteson:
  Critical factors in the performance of novelty search. 965-972
  
• Andrew M. Sutton, Darrell Whitley, Adele E. Howe:
  Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. 973-980
  
• Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen:
  Black-box complexities of combinatorial problems. 981-988
  
• Timo Kötzing, Dirk Sudholt, Madeleine Theile:
  How crossover helps in pseudo-boolean optimization. 989-996
  
• Tomasz Oliwa, Khaled Rasheed:
  A surrogate-assisted linkage inference approach in genetic algorithms. 997-1004
  
• Martin Pelikan, Mark Hauschild, Dirk Thierens:
  Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm. 1005-1012
  
• Martin Pelikan:
  Analysis of epistasis correlation on NK landscapes with nearest-neighbor interactions. 1013-1020
  
• Menglin Li, Colm O'Riordan, Seamus Hill:
  An analysis of multi-chromosome GAs in deceptive problems. 1021-1028
  
• Ni Chen, Jun Zhang:
  Index-based genetic algorithm for continuous optimization problems. 1029-1036
  
• Anabela Simões, Ernesto Costa:
  Memory-based CHC algorithms for the dynamic traveling salesman problem. 1037-1044
  
• Steve Dower, Clinton Woodward:
  ESDL: a simple description language for population-based evolutionary computation. 1045-1052
  
• Antonio Della Cioppa, Angelo Marcelli, Prisco Napoli:
  Speciation in evolutionary algorithms: adaptive species discovery. 1053-1060
  
• Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
  Spacing memetic algorithms. 1061-1068
  
• Lisa M. Guntly, Daniel R. Tauritz:
  Learning individual mating preferences. 1069-1076
  
• Dongxia Chang, Yao Zhao, Yanhui Xiao:
  A robust dynamic niching genetic clustering approach for image segmentation. 1077-1084
  
• Yuan-long Li, Jun Zhang:
  A new differential evolution algorithm with dynamic population partition and local restart. 1085-1092
  
• Wei-jie Yu, Jun Zhang:
  Multi-population differential evolution with adaptive parameter control for global optimization. 1093-1098
  
• Nasimul Noman, Danushka Bollegala, Hitoshi Iba:
  Differential evolution with self adaptive local search. 1099-1106
  
• Spyridon Samothrakis, Simon M. Lucas:
  Approximating n-player behavioural strategy nash equilibria using coevolution. 1107-1114
  
• Mohammad Nabi Omidvar, Xiaodong Li, Xin Yao:
  Smart use of computational resources based on contribution for cooperative co-evolutionary algorithms. 1115-1122
  
• Raymond Chiong, Michael Kirley:
  Iterated n-player games on small-world networks. 1123-1130
  
• Arthur Carvalho:
  A cooperative coevolutionary genetic algorithm for learning bayesian network structures. 1131-1138
  
• Rupesh Kumar Srivastava, Kalyanmoy Deb:
  An EA-based approach to design optimization using evidence theory. 1139-1146
  
• Gina M. B. Oliveira, Luiz G. A. Martins, Enrique Fynn:
  Adaptive strategies applied to evolutionary search for 2D DCT cellular automata rules. 1147-1154
  
• Kusum Deep, Madhuri Arya, Jagdish Chand Bansal:
  A non-deterministic adaptive inertia weight in PSO. 1155-1162
  
• Antonio Martí Campoy, Francisco Rodríguez-Ballester, Eugenio Tamura Morimitsu, Rafael Ors:
  An algorithm for deciding minimal cache sizes in real-time systems. 1163-1170
  
• Jiradej Vatanutanon, Nasimul Noman, Hitoshi Iba:
  Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithm. 1171-1178
  
• Alan J. Lockett, Risto Miikkulainen:
  Real-space evolutionary annealing. 1179-1186
  
• Yun-Geun Lee, Bob McKay:
  How hard should we run? 1187-1194
  

Genetics based machine learning track papers

• Kamran Shafi, Axel Bender, Hussein A. Abbass:
  Fleet estimation for defence logistics using a multi-objective learning classifier system. 1195-1202
  
• Hadi Sharifi, Amin Nikanjam, Adel Torkaman Rahmani:
  Interaction detection for hybrid decomposable problems. 1203-1210
  
• Farzaneh Shoeleh, Ali Hamzeh, Sattar Hashemi:
  Towards final rule set reduction in XCS: a fuzzy representation approach. 1211-1218
  
• Arcadio Rubio, José Antonio Gámez:
  Flexible learning of k-dependence Bayesian network classifiers. 1219-1226
  
• Mihaela Elena Breaban, Henri Luchian:
  PSO aided k-means clustering: introducing connectivity in k-means. 1227-1234
  
• Didier Marin, Jérémie Decock, Lionel Rigoux, Olivier Sigaud:
  Learning cost-efficient control policies with XCSF: generalization capabilities and further improvement. 1235-1242
  
• Martin V. Butz, Patrick O. Stalph:
  Modularization of xcsf for multiple output dimensions. 1243-1250
  
• Tim Kovacs, Narayanan Unny Edakunni, Gavin Brown:
  Accuracy exponentiation in UCS and its effect on voting margins. 1251-1258
  
• Filipe de Lima Arcanjo, Gisele L. Pappa, Paulo Viana Bicalho, Wagner Meira Jr., Altigran Soares da Silva:
  Semi-supervised genetic programming for classification. 1259-1266
  
• Narayanan Unny Edakunni, Gavin Brown, Tim Kovacs:
  Online, GA based mixture of experts: a probabilistic model of ucs. 1267-1274
  
• Gerard David Howard, Ella Gale, Larry Bull, Benjamin de Lacy Costello, Andrew Adamatzky:
  Evolving spiking networks with variable memristors. 1275-1282
  
• Charalambos Ioannides, Geoff Barrett, Kerstin Eder:
  XCS cannot learn all boolean functions. 1283-1290
  
• María A. Franco, Natalio Krasnogor, Jaume Bacardit:
  Modelling the initialisation stage of the ALKR representation for discrete domains and GABIL encoding. 1291-1298
  

Genetic programming track papers

• Su Nguyen, Mengjie Zhang, Mark Johnston:
  A genetic programming based hyper-heuristic approach for combinatorial optimisation. 1299-1306
  
• Alberto Moraglio, Sara Silva:
  Geometric nelder-mead algorithm on the space of genetic programs. 1307-1314
  
• R. Muhammad Atif Azad, Conor Ryan:
  Variance based selection to improve test set performance in genetic programming. 1315-1322
  
• Geng Li, Xiao-Jun Zeng:
  Genetic programming with a norm-referenced fitness function. 1323-1330
  
• Urvesh Bhowan, Mark Johnston, Mengjie Zhang:
  Evolving ensembles in multi-objective genetic programming for classification with unbalanced data. 1331-1338
  
• Theodoros Theodoridis, Alexandros Agapitos, Huosheng Hu:
  A gaussian groundplan projection area model for evolving probabilistic classifiers. 1339-1346
  
• Jeannie Fitzgerald, Conor Ryan:
  Drawing boundaries: using individual evolved class boundaries for binary classification problems. 1347-1354
  
• Leonardo Trujillo, Yuliana Martínez, Edgar Galván López, Pierrick Legrand:
  Predicting problem difficulty for genetic programming applied to data classification. 1355-1362
  
• Quang Uy Nguyen, Xuan Hoai Nguyen, Michael O'Neill:
  Examining the landscape of semantic similarity based mutation. 1363-1370
  
• David Jackson:
  Mutation as a diversity enhancing mechanism in genetic programming. 1371-1378
  
• Krzysztof Krawiec:
  Semantically embedded genetic programming: automated design of abstract program representations. 1379-1386
  
• Eoin Murphy, Michael O'Neill, Anthony Brabazon:
  A comparison of GE and TAGE in dynamic environments. 1387-1394
  
• Sara Silva:
  Reassembling operator equalisation: a secret revealed. 1395-1402
  
• Shelly Xiaonan Wu, Wolfgang Banzhaf:
  Rethinking multilevel selection in genetic programming. 1403-1410
  
• John Mark Swafford, Erik Hemberg, Michael O'Neill, Miguel Nicolau, Anthony Brabazon:
  A non-destructive grammar modification approach to modularity in grammatical evolution. 1411-1418
  
• Lee Spector, Brian Martin, Kyle Harrington, Thomas Helmuth:
  Tag-based modules in genetic programming. 1419-1426
  
• Thomas Ackling, Bradley Alexander, Ian Grunert:
  Evolving patches for software repair. 1427-1434
  
• Jun Wang, Ying Tan:
  Morphological image enhancement procedure design by using genetic programming. 1435-1442
  
• Robin Harper:
  Co-evolving robocode tanks. 1443-1450
  
• Peter A. Whigham, Rasika Withanawasam:
  Evolving a robust trader in a cyclic double auction market. 1451-1458
  
• Kangil Kim, MinHyeok Kim, Bob McKay:
  Structural difficulty in estimation of distribution genetic programming. 1459-1466
  
• Leonardo Vanneschi, Mauro Castelli, Luca Manzoni:
  The K landscapes: a tunably difficult benchmark for genetic programming. 1467-1474
  

Generative and developmental systems track papers

• Joshua E. Auerbach, Josh C. Bongard:
  Evolving complete robots with CPPN-NEAT: the utility of recurrent connections. 1475-1482
  
• Phillip Verbancsics, Kenneth O. Stanley:
  Constraining connectivity to encourage modularity in HyperNEAT. 1483-1490
  
• Simon Harding, Julian F. Miller, Wolfgang Banzhaf:
  SMCGP2: self modifying cartesian genetic programming in two dimensions. 1491-1498
  
• Rui L. Lopes, Ernesto Costa:
  Using feedback in a regulatory network computational device. 1499-1506
  
• Gunnar Tufte, Stefano Nichele:
  On the correlations between developmental diversity and genomic composition. 1507-1514
  
• Michael E. Palmer:
  Evolved neurogenesis and synaptogenesis for robotic control: the L-brain model. 1515-1522
  
• Marcin Suchorzewski, Jeff Clune:
  A novel generative encoding for evolving modular, regular and scalable networks. 1523-1530
  
• Paul Tonelli, Jean-Baptiste Mouret:
  On the relationships between synaptic plasticity and generative systems. 1531-1538
  
• Sebastian Risi, Kenneth O. Stanley:
  Enhancing es-hyperneat to evolve more complex regular neural networks. 1539-1546
  

Parallel evolutionary systems track papers

• Shigeyoshi Tsutsui, Noriyuki Fujimoto:
  ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignment. 1547-1554
  
• Luca Mussi, Youssef S. G. Nashed, Stefano Cagnoni:
  GPU-based asynchronous particle swarm optimization. 1555-1562
  
• Steven Solomon, Parimala Thulasiraman, Ruppa K. Thulasiram:
  Collaborative multi-swarm PSO for task matching using graphics processing units. 1563-1570
  
• Caner Candan, Johann Dréo, Pierre Savéant, Vincent Vidal:
  Parallel divide-and-evolve: experiments with OpenMP on a multicore machine. 1571-1578
  
• Matteo De Felice, Sandro Meloni, Stefano Panzieri:
  Effect of topology on diversity of spatially-structured evolutionary algorithms. 1579-1586
  
• Frank Neumann, Pietro Simone Oliveto, Günter Rudolph, Dirk Sudholt:
  On the effectiveness of crossover for migration in parallel evolutionary algorithms. 1587-1594
  
• Pavel Krömer, Václav Snásel, Jan Platos, Ajith Abraham:
  Many-threaded implementation of differential evolution for the CUDA platform. 1595-1602
  
• Maribel García Arenas, Juan Julián Merelo Guervós, Pedro A. Castillo, Juan Luís Jiménez Laredo, Gustavo Romero, Antonio Miguel Mora:
  Using free cloud storage services for distributed evolutionary algorithms. 1603-1610
  
• Carlos Segura, Eduardo Segredo, Coromoto León:
  Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem. 1611-1618
  

Real world applications track papers

• Garnett Carl Wilson, Simon Harding, Orland Hoeber, Rodolphe Devillers, Wolfgang Banzhaf:
  Large network analysis for fisheries management using coevolutionary genetic algorithms. 1619-1626
  
• Maoguo Gong, Tian Hou, Bao Fu, Licheng Jiao:
  A non-dominated neighbor immune algorithm for community detection in networks. 1627-1634
  
• Steffen Limmer, Dietmar Fey, Ulrich Lohmann, Jürgen Jahns:
  Evolutionary optimization of layouts for high density free space optical network links. 1635-1642
  
• Zorana Bankovic, David Fraga, Juan Carlos Vallejo, José Manuel Moya:
  Improving reputation systems for wireless sensor networks using genetic algorithms. 1643-1650
  
• Ricardo Araujo Costa, Adriano L. I. Oliveira, Sérgio Soares, Silvio Romero de Lemos Meira:
  An evolutionary approach to design dilation-erosion perceptrons for stock market indices forecasting. 1651-1658
  
• Shingo Mabu, Kotaro Hirasawa:
  Enhanced rule extraction and classification mechanism of genetic network programming for stock trading signal generation. 1659-1666
  
• Garnett Carl Wilson, Derek Leblanc, Wolfgang Banzhaf:
  Stock trading using linear genetic programming with multiple time frames. 1667-1674
  
• Martin C. Serpell, James E. Smith, Alistair R. Clark, Andrea T. Staggemeier:
  Scaling up a hybrid genetic linear programming algorithm for statistical disclosure control. 1675-1682
  
• Jésica de Armas, Gara Miranda, Coromoto León:
  Hyperheuristic encoding scheme for multi-objective guillotine cutting problems. 1683-1690
  
• Daniel W. Stouch, Ernest W. Zeidman, Marc D. Richards, Kirk D. McGraw, William J. Callahan:
  Coevolving collection plans for UAS constellations. 1691-1698
  
• Jason Ansel, Maciej Pacula, Saman P. Amarasinghe, Una-May O'Reilly:
  An efficient evolutionary algorithm for solving incrementally structured problems. 1699-1706
  
• Zizhen Zhang, Hu Qin, Andrew Lim:
  A genetic algorithm for the freight consolidation problem with one-dimensional container loading. 1707-1714
  
• Andrea Tettamanzi, Christel Dartigues-Pallez, Célia da Costa Pereira, Denis Pallez, Philippe Gourbesville:
  Coastal current prediction using CMA evolution strategies. 1715-1722
  
• Martin Lukasiewycz, Michael Glaß, Felix Reimann, Jürgen Teich:
  Opt4J: a modular framework for meta-heuristic optimization. 1723-1730
  
• David Cuesta Gómez, José Luis Risco-Martín, José Luis Ayala, José Ignacio Hidalgo:
  A combination of evolutionary algorithm and mathematical programming for the 3d thermal-aware floorplanning problem. 1731-1738
  
• Mitchell K. Colby, Ehsan M. Nasroullahi, Kagan Tumer:
  Optimizing ballast design of wave energy converters using evolutionary algorithms. 1739-1746
  
• Roberto Santana, Santiago Muelas, Antonio LaTorre, Jose M. Peña:
  A direct optimization approach to the P300 speller. 1747-1754
  
• Sean K. R. Lineaweaver, Gregory H. Wakefield:
  Psychometric augmentation of an interactive genetic algorithm for optimizing cochlear implant programs. 1755-1762
  
• Sunith Bandaru, Kalyanmoy Deb, Vineet R. Khare, Rahul Chougule:
  Quantitative modeling of customer perception from service data using evolutionary optimization. 1763-1770
  
• Danushka Bollegala, Nasimul Noman, Hitoshi Iba:
  RankDE: learning a ranking function for information retrieval using differential evolution. 1771-1778
  
• Thomas Bäck, Lutz Keßler, Ingo Heinle:
  Evolutionary strategies for identification and validation of material model parameters for forming simulations. 1779-1786
  
• M. Zubair Rafique, Nasser Alrayes, Muhammad Khurram Khan:
  Application of evolutionary algorithms in detecting SMS spam at access layer. 1787-1794
  
• Muhammad Bilal Junaid, Muddassar Farooq:
  Using evolutionary learning classifiers to do MobileSpam (SMS) filtering. 1795-1802
  
• Martin Simonsen, Christian N. S. Pedersen, Mikael H. Christensen, René Thomsen:
  GPU-accelerated high-accuracy molecular docking using guided differential evolution: real world applications. 1803-1810
  
• Paul K. Harmer, Michael A. Temple, Mark A. Buckner, Ethan Farquhar:
  Using differential evolution to optimize 'learning from signals' and enhance network security. 1811-1818
  
• J. Manuel Colmenar, José L. Risco-Martín, David Atienza, José Ignacio Hidalgo:
  Multi-objective optimization of dynamic memory managers using grammatical evolution. 1819-1826
  
• Antony Waldock, David Corne:
  Multiple objective optimisation applied to route planning. 1827-1834
  
• Hans Jonas Fossum Moen, Harald Hovland:
  Spanning the pareto front of a counter radar detection problem. 1835-1842
  
• Rituparna Datta, Kalyanmoy Deb:
  Multi-objective design and analysis of robot gripper configurations using an evolutionary-classical approach. 1843-1850
  

Search-based software engineering track papers

• Jungsup Oh, Mark Harman, Shin Yoo:
  Transition coverage testing for simulink/stateflow models using messy genetic algorithms. 1851-1858
  
• Stefan Mairhofer, Robert Feldt, Richard Torkar:
  Search-based software testing and test data generation for a dynamic programming language. 1859-1866
  
• Wesley Klewerton Guez Assunção, Thelma Elita Colanzi, Aurora Trinidad Ramirez Pozo, Silvia Regina Vergilio:
  Establishing integration test orders of classes with several coupling measures. 1867-1874
  
• Thaise Yano, Eliane Martins, Fabiano Luis de Sousa:
  A multi-objective evolutionary algorithm to obtain test cases with variable lengths. 1875-1882
  
• Daniel Rodríguez, Mercedes Ruiz Carreira, José C. Riquelme, Rachel Harrison:
  Multiobjective simulation optimisation in software project management. 1883-1890
  
• Florin-Claudiu Pop, Denis Pallez, Marcel Cremene, Andrea Tettamanzi, Mihai Suciu, Mircea-Florin Vaida:
  QoS-based service optimization using differential evolution. 1891-1898
  
• Soo Ling Lim, Peter J. Bentley:
  Evolving relationships between social networks and stakeholder involvement in software projects. 1899-1906
  
• Sam Ratcliff, David Robert White, John A. Clark:
  Searching for invariants using genetic programming and mutation testing. 1907-1914
  
• J. Francisco Chicano, Francisco Luna, Antonio J. Nebro, Enrique Alba:
  Using multi-objective metaheuristics to solve the software project scheduling problem. 1915-1922
  
• Jan Staunton, John A. Clark:
  Finding short counterexamples in promela models using estimation of distribution algorithms. 1923-1930
  

Self-* search

• Achiya Elyasaf, Ami Hauptman, Moshe Sipper:
  GA-FreeCell: evolving solvers for the game of FreeCell. 1931-1938
  
• Rodrigo César Pedrosa Silva, Rodolfo Ayala Lopes, Frederico Gadelha Guimarães:
  Self-adaptive mutation in the differential evolution. 1939-1946
  
• Jorge Tavares, Francisco Baptista Pereira:
  Towards the development of self-ant systems. 1947-1954
  
• Bilel Derbel, Sébastien Vérel:
  DAMS: distributed adaptive metaheuristic selection. 1955-1962
  
• Madalina M. Drugan, Dirk Thierens:
  Generalized adaptive pursuit algorithm for genetic pareto local search algorithms. 1963-1970
  
• Richard Allmendinger, Joshua Knowles:
  Policy learning in resource-constrained optimization. 1971-1978
  
• Marie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, Sébastien Vérel:
  The road to VEGAS: guiding the search over neutral networks. 1979-1986
  
• Edmund K. Burke, Michel Gendreau, Gabriela Ochoa, James D. Walker:
  Adaptive iterated local search for cross-domain optimisation. 1987-1994
  
• Wolfgang Konen, Patrick Koch, Oliver Flasch, Thomas Bartz-Beielstein, Martina Friese, Boris Naujoks:
  Tuned data mining: a benchmark study on different tuners. 1995-2002
  
• Kent McClymont, Edward Keedwell:
  Markov chain hyper-heuristic (MCHH): an online selective hyper-heuristic for multi-objective continuous problems. 2003-2010
  
• Ender Özcan, Andrew J. Parkes:
  Policy matrix evolution for generation of heuristics. 2011-2018
  
• Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle:
  Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework. 2019-2026
  

Theory track papers

• J. Francisco Chicano, Enrique Alba:
  Exact computation of the expectation curves of the bit-flip mutation using landscapes theory. 2027-2034
  
• Jonathan E. Rowe, Michael D. Vose:
  Unbiased black box search algorithms. 2035-2042
  
• Benjamin Doerr, Timo Kötzing, Carola Winzen:
  Too fast unbiased black-box algorithms. 2043-2050
  
• Chao Qian, Yang Yu, Zhi-Hua Zhou:
  An analysis on recombination in multi-objective evolutionary optimization. 2051-2058
  
• Sergiu Goschin, Michael L. Littman, David H. Ackley:
  The effects of selection on noisy fitness optimization. 2059-2066
  
• Gautham Anil, R. Paul Wiegand:
  Domain specific analysis and modeling of optimal elimination of fitness functions with optimal sampling. 2067-2074
  
• Per Kristian Lehre:
  Fitness-levels for non-elitist populations. 2075-2082
  
• Benjamin Doerr, Mahmoud Fouz, Carsten Witt:
  Sharp bounds by probability-generating functions and variable drift. 2083-2090
  
• Timo Kötzing, Frank Neumann, Reto Spöhel:
  PAC learning and genetic programming. 2091-2096
  

Last update Fri May 25 08:14:37 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page