Table of Contents

• Is there a computational advantage to representing evaporation rate in ant colony optimization as a gaussian random variable?Ashraf M. Abdelbar. 1-8 [doi]
• Learning fuzzy cognitive maps from data by ant colony optimizationYe Chen, Lawrence J. Mazlack, Long J. Lu. 9-16 [doi]
• Ants easily solve stochastic shortest path problemsBenjamin Doerr, Ashish Hota, Timo Kötzing. 17-24 [doi]
• Why six informants is optimal in PSOJosé García-Nieto, Enrique Alba. 25-32 [doi]
• CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networksAna Cristina B. Kochem Vendramin, Anelise Munaretto, Myriam Regattieri de Biase da Silva Delgado, Aline Carneiro Viana. 33-40 [doi]
• DACCO: a discrete ant colony algorithm to cluster geometry optimizationNuno C. Lourenço, Francisco Baptista Pereira. 41-48 [doi]
• A study of different quality evaluation functions in the cAnt-Miner(PB) classification algorithmMatthew Medland, Fernando E. B. Otero. 49-56 [doi]
• Optimal cyclic replacement policy in MSS maintenance via Binomial-PSOAngel Eduardo Muñoz Zavala, Evelyn Jade Hernández Ramos. 57-64 [doi]
• Integrating particle swarm optimization with reinforcement learning in noisy problemsGrigoris S. Piperagkas, George K. Georgoulas, Konstantinos E. Parsopoulos, Chrysostomos D. Stylios, Aristidis Likas. 65-72 [doi]
• Gaussian mixture modeling for dynamic particle swarm optimization of recurrent problemsEduardo Vellasques, Robert Sabourin, Eric Granger. 73-80 [doi]
• Multi-objective particle swarm optimisation (PSO) for feature selectionBing Xue, Mengjie Zhang, Will N. Browne. 81-88 [doi]
• Impact of neuron models and network structure on evolving modular robot neural network controllersLeo Cazenille, Nicolas Bredeche, Heiko Hamann, Jürgen Stradner. 89-96 [doi]
• Hierarchical task decomposition through symbiosis in reinforcement learningJohn Doucette, Peter Lichodzijewski, Malcolm I. Heywood. 97-104 [doi]
• Exploring and evolving process-oriented control for real and virtual fire fighting robotsKathryn Hardey, Eren Corapcioglu, Molly Mattis, Mark Goadrich, Matthew C. Jadud. 105-112 [doi]
• Open-ended coevolution and the emergence of complex irreducible functional units in iterated number sequence gamesBenjamin Inden. 113-120 [doi]
• Evolving axonal delay neural networks for robot controlFrancis Jeanson, Anthony White. 121-128 [doi]
• How to be a successful app developer: lessons from the simulation of an app ecosystemSoo Ling Lim, Peter J. Bentley. 129-136 [doi]
• Evolving network motifs based morphogenetic approach for self-organizing robotic swarmsYan Meng, Hongliang Guo. 137-144 [doi]
• Evolving flexible joint morphologiesJared M. Moore, Philip K. McKinley. 145-152 [doi]
• A comparison of a communication strategies in cooperative learningMichael Solomon, Terence Soule, Robert B. Heckendorn. 153-160 [doi]
• On the cumulative effect of bloat and genetic transposition on the efficiency of incremental evolution of snake-like robotIvan Tanev, Tüze Kuyucu, Katsunori Shimohara. 161-168 [doi]
• Efficient algorithms for extracting biological key pathways with global constraintsJan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling. 169-176 [doi]
• Evolving Bio-PEPA process algebra models using genetic programmingDavid Marco, Carron Shankland, David Cairns. 177-184 [doi]
• Reverse engineering of GRNs: an evolutionary approach based on the tsallis entropyMariana Recamonde Mendoza, Fabrício Martins Lopes, Ana Lúcia C. Bazzan. 185-192 [doi]
• Experimental evaluation of topological-based fitness functions to detect complexes in PPI networksClara Pizzuti, Simona E. Rombo. 193-200 [doi]
• Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless dataJesun Sahariar Firoz, M. Sohel Rahman, Tanay Kumar Saha. 201-208 [doi]
• ProRank: a method for detecting protein complexesNazar Zaki, Jose Berengueres, Dmitry Efimov. 209-216 [doi]
• HyperNEAT-GGP: a hyperNEAT-based atari general game playerMatthew J. Hausknecht, Piyush Khandelwal, Risto Miikkulainen, Peter Stone. 217-224 [doi]
• Accelerating human-computer collaborative search through learning comparative and predictive user modelsGregory S. Hornby, Josh C. Bongard. 225-232 [doi]
• Photogrowth: non-photorealistic renderings through ant paintingsPenousal Machado, Luís Pereira. 233-240 [doi]
• Incremental gaussian model-building in multi-objective EDAs with an application to deformable image registrationPeter A. N. Bosman, Tanja Alderliesten. 241-248 [doi]
• Influence of selection on structure learning in markov network EDAs: an empirical studyAlexander E. I. Brownlee, John A. W. McCall, Martin Pelikan. 249-256 [doi]
• A test problem with adjustable degrees of overlap and conflict among subproblemsWei-Ming Chen, Chung-Yu Shao, Po-Chun Hsu, Tian-Li Yu. 257-264 [doi]
• Higher-order linkage learning in the ECGADavid Iclanzan. 265-272 [doi]
• Distance-based bias in model-directed optimization of additively decomposable problemsMartin Pelikan, Mark Hauschild. 273-280 [doi]
• A memory efficient and continuous-valued compact EDA for large scale problemsSergio Rojas Galeano, Nestor Rodriguez. 281-288 [doi]
• Predetermined versus learned linkage modelsDirk Thierens, Peter A. N. Bosman. 289-296 [doi]
• A (1+1)-CMA-ES for constrained optimisationDirk V. Arnold, Nikolaus Hansen. 297-304 [doi]
• Mutation strength control by meta-ES on the sharp ridgeHans-Georg Beyer, Michael Hellwig. 305-312 [doi]
• Algorithm selection based on exploratory landscape analysis and cost-sensitive learningBernd Bischl, Olaf Mersmann, Heike Trautmann, Mike Preuß. 313-320 [doi]
• Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategyIlya Loshchilov, Marc Schoenauer, Michèle Sebag. 321-328 [doi]
• Natural evolution strategies converge on sphere functionsTom Schaul. 329-336 [doi]
• Towards a population-based framework for improving stochastic local search algorithmsIgnacio Araya, Leslie Pérez Cáceres, María-Cristina Riff. 337-344 [doi]
• From neighbors to global neighbors in collaborative filtering: an evolutionary optimization approachAmine M. Boumaza, Armelle Brun. 345-352 [doi]
• On the efficiency of an order-based representation in the clique covering problemDavid Chalupa. 353-360 [doi]
• An efficient genetic algorithm for subgraph isomorphismJaeun Choi, Yourim Yoon, Byung Ro Moon. 361-368 [doi]
• Local optima networks and the performance of iterated local searchFabio Daolio, Sébastien Vérel, Gabriela Ochoa, Marco Tomassini. 369-376 [doi]
• An evolutionary approach for the dubins' traveling salesman problem with neighborhoodsDouglas Guimarães Macharet, Armando Alves Neto, Vilar Fiuza da Camara Neto, Mario Fernando Montenegro Campos. 377-384 [doi]
• A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windowsWesam Herbawi, Michael Weber 0001. 385-392 [doi]
• An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problemBin Hu, Günther R. Raidl. 393-400 [doi]
• PSO based on surrogate modeling as meta-search to optimise evolutionary algorithms parametersAhmed Kattan, Mohammed Arif. 401-408 [doi]
• Challenging heuristics: evolving binary constraint satisfaction problemsJorge Humberto Moreno-Scott, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos. 409-416 [doi]
• A hybrid heuristic for the k-medoids clustering problemMariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce Leon Ferreira de Carvalho. 417-424 [doi]
• A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problemBo Song, Victor Li. 425-432 [doi]
• A parameterized runtime analysis of evolutionary algorithms for MAX-2-SATAndrew M. Sutton, Jareth Day, Frank Neumann. 433-440 [doi]
• A hybrid metaheuristic algorithm for flexible job-shop scheduling problems with transportation constraintsQiao Zhang, Hervé Manier, Marie-Ange Manier. 441-448 [doi]
• Adaptive multi-objective genetic algorithm using multi-pareto-rankingWahabou Abdou, Christelle Bloch, Damien Charlet, François Spies. 449-456 [doi]
• Convergence of hypervolume-based archiving algorithms ii: competitivenessKarl Bringmann, Tobias Friedrich. 457-464 [doi]
• On the properties of the R2 indicatorDimo Brockhoff, Tobias Wagner, Heike Trautmann. 465-472 [doi]
• Locality-based multiobjectivization for the HP model of protein structure predictionMario Garza-Fabre, Gregorio Toscano Pulido, Eduardo Rodriguez-Tello. 473-480 [doi]
• Effects of discrete objective functions with different granularities on the search behavior of EMO algorithmsHisao Ishibuchi, Masakazu Yamane, Yusuke Nojima. 481-488 [doi]
• Lorenz equilibrium: equitability in non-cooperative gamesRéka Nagy, Mihai Alexandru Suciu, D. Dumitrescu. 489-496 [doi]
• Leveraging indicator-based ensemble selection in evolutionary multiobjective optimization algorithmsDung H. Phan, Junichi Suzuki, Isao Hayashi. 497-504 [doi]
• A new multi-objective evolutionary algorithm based on a performance assessment indicatorCynthia A. Rodríguez Villalobos, Carlos A. Coello Coello. 505-512 [doi]
• Local preference-inspired co-evolutionary algorithmsRui Wang, Robin C. Purshouse, Peter J. Fleming. 513-520 [doi]
• On the relationship between environmental and morphological complexity in evolved robotsJoshua E. Auerbach, Josh C. Bongard. 521-528 [doi]
• A manifold operator representation for adaptive designJacob Beal, Hala Mostafa, Annan Mozeika, Benjamin Axelrod, Aaron Adler, Gretchen Markiewicz, Kyle Usbeck. 529-536 [doi]
• A cell-based developmental model to generate robot morphologiesSylvain Cussat-Blanc, Jordan Pollack. 537-544 [doi]
• Distance measures for HyperGP with fitness sharingJan Drchal, Miroslav Snorek. 545-552 [doi]
• Complex and diverse morphologies can develop from a minimal genomic modelJose D. Fernández, Francisco J. Vico, René Doursat. 553-560 [doi]
• Co-evolution of morphology and control of soft-bodied multicellular animatsMichal Joachimczak, Borys Wróbel. 561-568 [doi]
• An evo-devo approach to architectural designDaniel Richards, Nick Dunn, Martyn Amos. 569-576 [doi]
• Morphologies of self-organizing swarms in 3D swarm chemistryHiroki Sayama. 577-584 [doi]
• Linkage neighbors, optimal mixing and forced improvements in genetic algorithmsPeter A. N. Bosman, Dirk Thierens. 585-592 [doi]
• Efficient filters for the simulated evolution of small sorting networksDrue Coles. 593-600 [doi]
• An empirical approach to the measurement of interchromosomal distances in the genetic algorithmRobert Collier, Mark Wineberg. 601-608 [doi]
• Depictions of genotypic space for evaluating the suitability of different recombination operatorsRobert Collier, Christian Fobel, Gary William Grewal, Mark Wineberg. 609-616 [doi]
• Estimating the evolution direction of populations to improve genetic algorithmsAndrea De Lucia, Massimiliano Di Penta, Rocco Oliveto, Annibale Panichella. 617-624 [doi]
• Linkage tree genetic algorithms: variants and analysisBrian W. Goldman, Daniel R. Tauritz. 625-632 [doi]
• Image segmentation using a genetic algorithm and hierarchical local searchMark Hauschild, Sanjiv Bhatia, Martin Pelikan. 633-640 [doi]
• Off-line building block identification: detecting building blocks directly from fitness without genetic algorithmsHsuan Lee, Tian-Li Yu. 641-648 [doi]
• Runtime analysis of convex evolutionary searchAlberto Moraglio, Dirk Sudholt. 649-656 [doi]
• Dynamic segregative genetic algorithm for optimizing the variable ordering of ROBDDsCristian Rotaru, Octav Brudaru. 657-664 [doi]
• How long should we run in dynamic optimization?Briseida Sarasola, Enrique Alba. 665-672 [doi]
• Enhancing the virtual loser genetic algorithm for dynamic environmentsAnabela Simões, Ernesto Costa. 673-680 [doi]
• A genetic algorithm for designing neural network ensemblesSymone Soares, Carlos Henggeler Antunes, Rui Araújo. 681-688 [doi]
• Crossover speeds up building-block assemblyDirk Sudholt. 689-702 [doi]
• GP under streaming data constraints: a case for pareto archiving?Aaron Atwater, Malcolm I. Heywood, A. Nur Zincir-Heywood. 703-710 [doi]
• Automatic generation of graph models for complex networks by genetic programmingAlexander Bailey, Mario Ventresca, Beatrice M. Ombuki-Berman. 711-718 [doi]
• A new methodology for the GP theory toolboxJeffrey K. Bassett, Uday Kamath, Kenneth A. De Jong. 719-726 [doi]
• Parameter tuning of evolutionary reactions systemsMauro Castelli, Luca Manzoni, Leonardo Vanneschi. 727-734 [doi]
• Symbolic regression of multiple-time-scale dynamical systemsTheodore W. Cornforth, Hod Lipson. 735-742 [doi]
• Exploring boundaries: optimising individual class boundaries for binary classification problemJeannie Fitzgerald, Conor Ryan. 743-750 [doi]
• MT-CGP: mixed type cartesian genetic programmingSimon Harding, Vincent Graziano, Jürgen Leitner, Jürgen Schmidhuber. 751-758 [doi]
• Spatial co-evolution: quicker, fitter and less bloatedRobin Harper. 759-766 [doi]
• An investigation of local patterns for estimation of distribution genetic programmingErik Hemberg, Kalyan Veeramachaneni, James McDermott, Constantin Berzan, Una-May O'Reilly. 767-774 [doi]
• Sensitive ants are sensible antsMuhammad Rezaul Karim 0002, Conor Ryan. 775-782 [doi]
• On relationships between semantic diversity, complexity and modularity of programming tasksKrzysztof Krawiec. 783-790 [doi]
• Genetic programming needs better benchmarksJames McDermott, David R. White, Sean Luke, Luca Manzoni, Mauro Castelli, Leonardo Vanneschi, Wojciech Jaskowski, Krzysztof Krawiec, Robin Harper, Kenneth A. De Jong, Una-May O'Reilly. 791-798 [doi]
• Computational complexity analysis of multi-objective genetic programmingFrank Neumann. 799-806 [doi]
• Evolving the best known approximation to the Q functionDao Ngoc Phong, Nguyen Xuan Hoai, Robert Ian (Bob) McKay, Constantin Siriteanu, Nguyen Quang Uy, Namyong Park. 807-814 [doi]
• Tag-based modularity in tree-based genetic programmingLee Spector, Kyle Ira Harrington, Thomas Helmuth. 815-822 [doi]
• Comparing methods for module identification in grammatical evolutionJohn Mark Swafford, Miguel Nicolau, Erik Hemberg, Michael O'Neill, Anthony Brabazon. 823-830 [doi]
• A developmental solution to (dynamic) capacitated arc routing problems using genetic programmingThomas Weise, Alexandre Devert, Ke Tang. 831-838 [doi]
• XCS-based versus UCS-based feature pattern classification systemToktam Ebadi, Mengjie Zhang, Will N. Browne. 839-846 [doi]
• Post-processing operators for decision listsMaría A. Franco, Natalio Krasnogor, Jaume Bacardit. 847-854 [doi]
• Genetic programming for edge detection using blocks to extract featuresWenlong Fu, Mark Johnston, Mengjie Zhang. 855-862 [doi]
• Extracting and using building blocks of knowledge in learning classifier systemsMuhammad Iqbal 0001, Will N. Browne, Mengjie Zhang. 863-870 [doi]
• Filtering sensory information with XCSF: improving learning robustness and control performanceJan Kneissler, Patrick O. Stalph, Jan Drugowitsch, Martin V. Butz. 871-878 [doi]
• Multi-objective evolutionary optimization for generating ensembles of classifiers in the ROC spaceJulien-Charles Levesque, Audrey Durand, Christian Gagné, Robert Sabourin. 879-886 [doi]
• Sample aware embedded feature selection for reinforcement learningSteven Loscalzo, Robert Wright, Kevin Acunto, Lei Yu. 887-894 [doi]
• Two-cornered learning classifier systems for pattern generation and classificationSyahaneim Marzukhi, Will N. Browne, Mengjie Zhang. 895-902 [doi]
• CMA-TWEANN: efficient optimization of neural networks via self-adaptation and seamless augmentationHirotaka Moriguchi, Shinichi Honiden. 903-910 [doi]
• Guided evolution in XCSFPatrick O. Stalph, Martin V. Butz. 911-918 [doi]
• Accelerating evolution via egalitarian social learningWesley Tansey, Eliana Feasley, Risto Miikkulainen. 919-926 [doi]
• Instance-linked attribute tracking and feedback for michigan-style supervised learning classifier systemsRyan J. Urbanowicz, Ambrose Granizo-Mackenzie, Jason H. Moore. 927-934 [doi]
• Automated mechanism design with co-evolutionary hierarchical genetic programming techniquesJohn A. Doucette, Darren Abramson. 935-942 [doi]
• Evolutionary advantage of foresight in marketsDaniel Hennes, Daan Bloembergen, Michael Kaisers, Karl Tuyls, Simon Parsons. 943-950 [doi]
• An approach for estimating separability and its application on high dimensional optimizationRicardo Landa Becerra, Yazmin Rojas, Gregorio Toscano Pulido. 951-958 [doi]
• Representations and operators for improving evolutionary software repairClaire Le Goues, Westley Weimer, Stephanie Forrest. 959-966 [doi]
• Co-evolutionary predictors for kinematic pose inference from RGBD imagesDaniel Le Ly, Ashutosh Saxena, Hod Lipson. 967-974 [doi]
• SDE: a stochastic coding differential evolution for global optimizationJinghui Zhong, Jun Zhang. 975-982 [doi]
• The use of reputation as noise-resistant selection bias in a co-evolutionary multi-agent systemNikolaos Chatzinikolaou, David Robertson. 983-990 [doi]
• An improved CUDA-based implementation of differential evolution on GPUA. K. Qin, Federico Raimondo, Florence Forbes, Yew-Soon Ong. 991-998 [doi]
• A GPU-based implementation of an enhanced GEP algorithmShuai Shao, Xiyang Liu, Mingyuan Zhou, Jiguo Zhan, Xin Liu, Yanli Chu, Hao Chen. 999-1006 [doi]
• Asynchronous master/slave moeas and heterogeneous evaluation costsMouadh Yagoubi, Marc Schoenauer. 1007-1014 [doi]
• Evolving distributed resource sharing for cubesat constellationsAdrian K. Agogino, Chris HolmesParker, Kagan Tumer. 1015-1022 [doi]
• Evolving large scale UAV communication systemAdrian K. Agogino, Chris HolmesParker, Kagan Tumer. 1023-1030 [doi]
• Breast cancer detection using cartesian genetic programming evolved artificial neural networksArbab Masood Ahmad, Gul Muhammad Khan, Sahibzada Ali Mahmud, Julian Francis Miller. 1031-1038 [doi]
• Application of evolutionary methods to 3D geoscience modellingBradley Alexander, Stephan Thiel, Jared Peacock. 1039-1046 [doi]
• Evaluation of the performance of evolutionary algorithms for optimization of low-enthalpy geothermal heating plantsMarkus Beck, Michael de Paly, Jozsef Hecht-Méndez, Peter Bayer, Andreas Zell. 1047-1054 [doi]
• A new SAX-GA methodology applied to investment strategies optimizationAntónio Canelas, Rui Ferreira Neves, Nuno Horta. 1055-1062 [doi]
• A preference-based bi-objective approach to the payment scheduling negotiation problem with the extended r-dominance and NSGA-iiWei-neng Chen, Jun Zhang 0003, Jinghui Zhong. 1063-1070 [doi]
• Using interactive evolutionary computation (IEC) with validated surrogate fitness functions for redistrictingChristine Chou, Steven Orla Kimbrough, John Sullivan-Fedock, C. Jason Woodard, Frederic H. Murphy. 1071-1078 [doi]
• Metaheuristic approaches to tool selection optimisationAlexander W. Churchill, Phil Husbands, Andrew Philippides. 1079-1086 [doi]
• Evolving a conspicuous point detector based on an artificial dorsal stream: SLAM systemDaniel E. Hernández, Gustavo Olague, Eddie Clemente, León Dozal. 1087-1094 [doi]
• Surrogate modeling in the evolutionary optimization of catalytic materialsMartin Holena, David Linke, Lukás Bajer. 1095-1102 [doi]
• The unconstrained automated generation of cell image features for medical diagnosisTaras Kowaliw, Wolfgang Banzhaf. 1103-1110 [doi]
• Evolutionary feature selection for classification: a plug-in hybrid vehicle adoption applicationJoseph S. Krupa, Somdeb Chatterjee, Ethan Eldridge, Donna M. Rizzo, Margaret J. Eppstein. 1111-1118 [doi]
• GENOM-POF: multi-objective evolutionary synthesis of analog ICs with corners validationNuno C. Lourenço, Nuno Horta. 1119-1126 [doi]
• LAYGEN II: automatic analog ICs layout generator based on a template approachRicardo Martins, Nuno C. Lourenço, Nuno Horta. 1127-1134 [doi]
• Evolutionary approaches to the generation of optimal error correcting codesDaniel E. McCarney, Sheridan Houghten, Brian J. Ross. 1135-1142 [doi]
• Multi-container loading with non-convex 3D shapes using a GA/TS hybridPhilipp Nebel, Gunther Richter, Karsten Weicker. 1143-1150 [doi]
• Evolutionary algorithms applied to elucidate ionic water cluster structure formationOmar Paranaiba Vilela Neto, André S. Pimentel, Marco Aurélio Cavalcanti Pacheco, Ênio Frota da Silveira. 1151-1158 [doi]
• Introducing the use of model-based evolutionary algorithms for EEG-based motor imagery classificationRoberto Santana, Laurent Bonnet, Jozef Legény, Anatole Lécuyer. 1159-1166 [doi]
• Hybrid metaheuristic particle filters for stochastic volatility estimationRobert Elliott Smith, Muhammad Shakir Hussain. 1167-1174 [doi]
• Darwinian rivers: evolving stream topographies to match hyporheic residence time distributionsForrest Stonedahl, Susa H. Stonedahl. 1175-1182 [doi]
• Estimating markov switching model using differential evolution algorithm in prospective infectious disease outbreak detectionRui-tian Xu, Jun Zhang 0003. 1183-1190 [doi]
• t(k)-SA: accelerated simulated annealing algorithm for application mapping on networks-on-chipBo Yang 0009, Liang Guang, Tero Säntti, Juha Plosila. 1191-1198 [doi]
• Ant colony optimization algorithm for lifetime maximization in wireless sensor network with mobile sinkJinghui Zhong, Jun Zhang. 1199-1204 [doi]
• An analysis of the effects of composite objectives in multiobjective software module clusteringMárcio de Oliveira Barros. 1205-1212 [doi]
• Evolutionary algorithm for prioritized pairwise test data generationJavier Ferrer, Peter M. Kruse, J. Francisco Chicano, Enrique Alba. 1213-1220 [doi]
• Evolutionary algorithms for the project scheduling problem: runtime analysis and improved designLeandro L. Minku, Dirk Sudholt, Xin Yao. 1221-1228 [doi]
• Multi-objective coevolutionary automated software correctionJosh L. Wilkerson, Daniel R. Tauritz, James M. Bridges. 1229-1236 [doi]
• A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithmsRodrigo C. Barros, Márcio P. Basgalupp, André Carlos Ponce Leon Ferreira de Carvalho, Alex Alves Freitas. 1237-1244 [doi]
• Meta-optimization for parameter tuning with a flexible computing budgetJürgen Branke, Jawad Asem Elomari. 1245-1252 [doi]
• A dynamic island model for adaptive operator selectionCaner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion. 1253-1260 [doi]
• On neighborhood tree searchHouda Derbel, Bilel Derbel. 1261-1268 [doi]
• Improving the performance of vector hyper-heuristics through local searchJosé Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Ender Özcan, Andrew J. Parkes. 1269-1276 [doi]
• An exploration-exploitation compromise-based adaptive operator selection for local searchNadarajen Veerapen, Jorge Maturana, Frédéric Saubion. 1277-1284 [doi]
• Adaptive differential evolution with optimization state estimationWei jie Yu, Jun Zhang. 1285-1292 [doi]
• Analysis of a natural gradient algorithm on monotonic convex-quadratic-composite functionsYouhei Akimoto. 1293-1300 [doi]
• Exact computation of the expectation curves for uniform crossoverJ. Francisco Chicano, Darrell Whitley, Enrique Alba. 1301-1308 [doi]
• Reducing the arity in unbiased black-box complexityBenjamin Doerr, Carola Winzen. 1309-1316 [doi]
• Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabetBenjamin Doerr, Sebastian Pohl. 1317-1324 [doi]
• Fixed budget computations: a different perspective on run time analysisThomas Jansen, Christine Zarges. 1325-1332 [doi]
• The max problem revisited: the importance of mutation in genetic programmingTimo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly. 1333-1340 [doi]
• On the analysis of the simple genetic algorithmPietro Simone Oliveto, Carsten Witt. 1341-1348 [doi]
• The choice of the offspring population size in the (1, λ) EAJonathan E. Rowe, Dirk Sudholt. 1349-1356 [doi]
• Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSATDarrell Whitley, Wenxiang Chen. 1357-1364 [doi]