Table of Contents

• Beyond biology: designing a new mechanism for self-replication and evolution at the nanoscaleRebecca Schulman. 7-14 [doi]
• Assembling living materials and engineering life-like technologiesSteen Rasmussen, Anders Albertsen, Harold Fellermann, Pernille Lykke Pedersen, Carsten Svaneborg, Hans Ziock. 15-20 [doi]
• A performance study on synchronous and asynchronous updates in particle swarm optimizationJuan Rada-Vilela, Mengjie Zhang, Winston Seah. 21-28 [doi]
• Particle swarm optimisation with gradually increasing directed neighbourhoodsHongliang Liu, Enda Howley, Jim Duggan. 29-36 [doi]
• An investigation into the merger of stochastic diffusion search and particle swarm optimisationMohammad Majid al-Rifaie, John Mark Bishop, Tim Blackwell. 37-44 [doi]
• Detection of continuous, smooth and thin edges in noisy images using constrained particle swarm optimisationMahdi Setayesh, Mengjie Zhang, Mark Johnston. 45-52 [doi]
• Selection strategies for initial positions and initial velocities in multi-optima particle swarmsStephen Chen, James Montgomery. 53-60 [doi]
• Diversity preservation using excited particle swarm optimisationShannon S. Pace, Clinton Woodward. 61-68 [doi]
• A multi-objective particle swarm optimizer based on decompositionSaúl Zapotecas Martínez, Carlos A. Coello Coello. 69-76 [doi]
• Hybrid particle swarm optimisation based on history information sharingWenlong Fu, Mark Johnston, Mengjie Zhang. 77-84 [doi]
• PSO based motion deblurring for single imageChunhe Song, Hai Zhao, Wei Jing, Hongbo Zhu. 85-92 [doi]
• Bonding as a swarm: applying bee nest-site selection behaviour to protein dockingKonrad Diwold, Daniel Himmelbach, René Meier, Carsten Baldauf, Martin Middendorf. 93-100 [doi]
• A honey bees mating optimization algorithm for the open vehicle routing problemYannis Marinakis, Magdalene Marinaki. 101-108 [doi]
• Opposition-based artificial bee colony algorithmMohammed El-Abd. 109-116 [doi]
• Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networksChristian Domínguez-Medina, Nareli Cruz Cortés. 117-124 [doi]
• An incremental ant colony algorithm with local search for continuous optimizationTianjun Liao, Marco Antonio Montes de Oca, Dogan Aydin, Thomas Stützle, Marco Dorigo. 125-132 [doi]
• Parallel exploitation in estimated basins of attraction: a new derivative-free optimization algorithmYing Lin, Jing-Hui Zhong, Jun Zhang. 133-138 [doi]
• An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functionsMarta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes. 139-146 [doi]
• Empirical computation of the quasi-optimal number of informants in particle swarm optimizationJosé García-Nieto, Enrique Alba. 147-154 [doi]
• Ant colony optimization for determining the optimal dimension and delays in phase space reconstructionWei-neng Chen, Jun Zhang 0003. 155-162 [doi]
• Car sequencing with constraint-based ACODhananjay Raghavan Thiruvady, Bernd Meyer, Andreas T. Ernst. 163-170 [doi]
• An algorithm for distributed on-line, on-board evolutionary roboticsGiorgos Karafotias, Evert Haasdijk, Ágoston E. Eiben. 171-178 [doi]
• Morphological and environmental scaffolding synergize when evolving robot controllers: artificial life/robotics/evolvable hardwareJosh C. Bongard. 179-186 [doi]
• Racing to improve on-line, on-board evolutionary roboticsEvert Haasdijk, Arif Atta-ul-Qayyum, Ágoston E. Eiben. 187-194 [doi]
• Coupled inverted pendulums: a benchmark for evolving decentral controllers in modular roboticsHeiko Hamann, Thomas Schmickl, Karl Crailsheim. 195-202 [doi]
• The evolution of optimal foraging strategies in populations of digital organismsJacob Charles Walker. 203-210 [doi]
• Evolving a diversity of virtual creatures through novelty search and local competitionJoel Lehman, Kenneth O. Stanley. 211-218 [doi]
• Rapid host-parasite coevolution drives the production and maintenance of diversity in digital organismsLuis Zaman, Suhas Devangam, Charles Ofria. 219-226 [doi]
• Modeling the evolutionary dynamics of plasmids in spatial populationsBrian D. Connelly, Luis Zaman, Philip K. McKinley, Charles Ofria. 227-234 [doi]
• Evolution of neural symmetry and its coupled alignment to body plan morphologyBen Jones, Andrea Soltoggio, Bernhard Sendhoff, Xin Yao. 235-242 [doi]
• Digital enzymes: agents of reaction inside robotic controllers for the foraging problemChad M. Byers, Betty H. C. Cheng, Philip K. McKinley. 243-250 [doi]
• Spontaneous evolution of structural modularity in robot neural network controllers: artificial life/robotics/evolvable hardwareJosh C. Bongard. 251-258 [doi]
• How to promote generalisation in evolutionary robotics: the ProGAb approachTony Pinville, Sylvain Koos, Jean-Baptiste Mouret, Stéphane Doncieux. 259-266 [doi]
• Why and how to measure exploration in behavioral spaceCharles Ollion, Stéphane Doncieux. 267-274 [doi]
• Agent fitness functions for evolving coordinated sensor networksChristian Roth, Matt Knudson, Kagan Tumer. 275-282 [doi]
• Analysing structure in complex networks using quality functions evolved by genetic programmingFergal Reid, Neil J. Hurley. 283-290 [doi]
• Evolving random boolean networks with genetic algorithms for regulatory networks reconstructionMariana Recamonde Mendoza, Ana Lúcia C. Bazzan. 291-298 [doi]
• The power of quantitative grammatical evolution neural networks to detect gene-gene interactionsNicholas E. Hardison, Alison A. Motsinger-Reif. 299-306 [doi]
• Automated modeling of stochastic reactions with large measurement time-gapsMichael Douglas Schmidt, Hod Lipson. 307-314 [doi]
• Evolutionary-based iterative local search algorithm for the shortest common supersequence problemJirí Kubalík. 315-322 [doi]
• Conotoxin protein classification using pairwise comparison and amino acid composition: toxin-aamNazar Zaki, Fadi N. Sibai, Piers Campbell. 323-330 [doi]
• Affinity propagation enhanced by estimation of distribution algorithmsRoberto Santana, Concha Bielza, Pedro Larrañaga. 331-338 [doi]
• A novel probabilistic encoding for EAs applied to biclustering of microarray dataMichaël Marcozzi, Federico Divina, Jesús S. Aguilar-Ruiz, Wim Vanhoof. 339-346 [doi]
• A genetic algorithm to enhance transmembrane helices predictionNazar Zaki, Salah Bouktif, Sanja Lazarova-Molnar. 347-354 [doi]
• Learning n-tuple networks for othello by coevolutionary gradient searchKrzysztof Krawiec, Marcin Grzegorz Szubert. 355-362 [doi]
• Evolving patch-based terrains for use in video gamesWilliam L. Raffe, Fabio Zambetta, Xiaodong Li. 363-370 [doi]
• Human-assisted neuroevolution through shaping, advice and examplesIgor Karpov, Vinod K. Valsalam, Risto Miikkulainen. 371-378 [doi]
• Evolving neural networks for geometric game-tree pruningJason Gauci, Kenneth O. Stanley. 379-386 [doi]
• Interactively evolving harmonies through functional scaffoldingAmy K. Hoover, Paul A. Szerlip, Kenneth O. Stanley. 387-394 [doi]
• Interactive evolution for the procedural generation of tracks in a high-end racing gameLuigi Cardamone, Daniele Loiacono, Pier Luca Lanzi. 395-402 [doi]
• An executable graph representation for evolutionary generative musicJames McDermott, Una-May O Reilly. 403-410 [doi]
• Multi-objective feature selection in music genre and style recognition tasksIgor Vatolkin, Mike Preuß, Günter Rudolph. 411-418 [doi]
• Originality and diversity in the artificial evolution of melodiesAlan R. R. de Freitas, Frederico Gadelha Guimarães. 419-426 [doi]
• Evolving art with scalable vector graphicsEelco den Heijer, Ágoston E. Eiben. 427-434 [doi]
• Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problemClaudio Fabiano Motta Toledo, Márcio da Silva Arantes, Paulo Morelato França. 443-448 [doi]
• Metaheuristic for parallel machines scheduling with resource-assignable sequence dependent setup timesLuís H. C. Bicalho, André Gustavo dos Santos, José Elias Claudio Arroyo. 449-456 [doi]
• Heuristic techniques for variable and value ordering in CSPsMalek Mouhoub, Bahareh Jafari Jashmi. 457-464 [doi]
• Population-based and learning-based metaheuristic algorithms for the graph coloring problemDavid Chalupa. 465-472 [doi]
• Genetic approaches for graph partitioning: a surveyJin Kim, Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon. 473-480 [doi]
• A hybrid heuristic approach for solving the generalized traveling salesman problemPetrica C. Pop, Serban Iordache. 481-488 [doi]
• The TransRAR crossover operator for genetic algorithms with set encodingRubén Ruiz-Torrubiano, Alberto Suárez. 489-496 [doi]
• A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problemsAhmed Kafafy, Ahmed Bounekkar, Stéphane Bonnevay. 497-504 [doi]
• Evolving optimal agendas for package deal negotiationShaheen Fatima, Ahmed Kattan. 505-512 [doi]
• A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problemsMalika Mehdi, Jean-Claude Charr, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry. 513-520 [doi]
• An efficient hierarchical parallel genetic algorithm for graph coloring problemReza Abbasian, Malek Mouhoub. 521-528 [doi]
• Partial neighborhoods of the traveling salesman problemDarrell Whitley, Gabriela Ochoa. 529-536 [doi]
• P-GLS-II: an enhanced version of the population-based guided local searchNasser Tairan, Qingfu Zhang. 537-544 [doi]
• Harmony search with differential mutation based pitch adjustmentA. K. Qin, Florence Forbes. 545-552 [doi]
• Imitation tendencies of local search schemes in baldwinian evolutionShu Liu, Hitoshi Iba. 553-560 [doi]
• Predictive parameter controlAldeida Aleti, Irene Moser. 561-568 [doi]
• The essence of real-valued characteristic function for pairwise relation in linkage learning for EDAsJui-Ting Lee, Kai-Chun Fan, Tian-Li Yu. 569-576 [doi]
• Parameter-less local optimizer with linkage identification for deterministic order-k decomposable problemsPetr Posík, Stanislav Vanícek. 577-584 [doi]
• Dependence trees with copula selection for continuous estimation of distribution algorithmsRogelio Salinas-Gutiérrez, Arturo Hernández Aguirre, Enrique Raúl Villa Diharce. 585-592 [doi]
• Regularized k-order markov models in EDAsRoberto Santana, Hossein Karshenas, Concha Bielza, Pedro Larrañaga. 593-600 [doi]
• Use of infeasible individuals in probabilistic model building genetic network programmingXianneng Li, Shingo Mabu, Kotaro Hirasawa. 601-608 [doi]
• A preliminary study on EDAs for permutation problems based on marginal-based modelsJosu Ceberio, Alexander Mendiburu, Jose Antonio Lozano. 609-616 [doi]
• Optimal mixing evolutionary algorithmsDirk Thierens, Peter A. N. Bosman. 617-624 [doi]
• Advanced neighborhoods and problem difficulty measuresMark Hauschild, Martin Pelikan. 625-632 [doi]
• Hierarchical allelic pairwise independent functionsDavid Iclanzan. 633-640 [doi]
• Maximizing population diversity in single-objective optimizationTamara Ulrich, Lothar Thiele. 641-648 [doi]
• A many-objective test problem for visually examining diversity maintenance behavior in a decision spaceHisao Ishibuchi, Naoya Akedo, Yusuke Nojima. 649-656 [doi]
• Indicator-based differential evolution using exclusive hypervolume approximation and parallelization for multi-core processorsKiyoharu Tagawa, Hidehito Shimizu, Hiroyuki Nakamura. 657-664 [doi]
• Adaptive multi-objective differential evolution with stochastic coding strategyJing-Hui Zhong, Jun Zhang. 665-672 [doi]
• Differential evolution for RFID antenna design: a comparison with ant colony optimisationJames Montgomery, Marcus Randall, Andrew Lewis. 673-680 [doi]
• Using pareto-optimality for solving multi-objective unequal area facility layout problemKazi Shah Nawaz Ripon, Kashif Nizam Khan, Kyrre Glette, Mats Høvin, Jim Torresen. 681-688 [doi]
• Robust design of a re-entry unmanned space vehicle by multi-fidelity evolution controlEdmondo A. Minisci, Massimiliano Vasile. 689-696 [doi]
• An evolutionary bi-objective approach to the capacitated facility location problem with cost and CO::2:: emissionsIrina Harris, Christine L. Mumford, Mohamed M. Naim. 697-704 [doi]
• Investigating relevant aspects of MOEAs for protein structures predictionChristiane Regina Soares Brasil, Alexandre Cláudio Botazzo Delbem, Daniel Rodrigo Ferraz Bonetti. 705-712 [doi]
• Evolving policies for multi-reward partially observable markov decision processes (MR-POMDPs)Harold Soh, Yiannis Demiris. 713-720 [doi]
• Interactive MOEA/D for multi-objective decision makingMaoguo Gong, Fang Liu, Wei Zhang, Licheng Jiao, Qingfu Zhang. 721-728 [doi]
• Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedronJing Sun, Dunwei Gong, Xiaoyan Sun. 729-736 [doi]
• Visualizing 4D approximation sets of multiobjective optimizers with prosectionsTea Tusar, Bogdan Filipic. 737-744 [doi]
• Convergence of hypervolume-based archiving algorithms I: effectivenessKarl Bringmann, Tobias Friedrich. 745-752 [doi]
• Improved S-CDAs using crossover controlling the number of crossed genes for many-objective optimizationHiroyuki Sato, Hernán E. Aguirre, Kiyoshi Tanaka. 753-760 [doi]
• Set-based multiobjective fitness landscapes: a preliminary studySébastien Vérel, Arnaud Liefooghe, Clarisse Dhaenens. 769-776 [doi]
• Population-ACO for the automotive deployment problemIrene Moser, James Montgomery. 777-784 [doi]
• A RankMOEA to approximate the pareto front of a dynamic principal-agent modelJuan Arturo Herrera Ortiz, Katya Rodríguez-Vázquez, Itza T. Q. Curiel Cabral, Sonia Di Giannatale Menegalli. 785-792 [doi]
• Accumulative sampling for noisy evolutionary multi-objective optimizationTaejin Park, Kwang Ryel Ryu. 793-800 [doi]
• Comparison-based complexity of multiobjective optimizationOlivier Teytaud. 801-806 [doi]
• Integrated circuit optimization by means of evolutionary multi-objective optimizationMatthias W. Blesken, Anouar Chebil, Ulrich Rückert, Xavier Esquivel, Oliver Schütze. 807-812 [doi]
• Noisy optimization: a theoretical strategy comparison of ES, EGS, SPSA & IF on the noisy sphereSteffen Finck, Hans-Georg Beyer, Alexander Melkozerov. 813-820 [doi]
• When parameter tuning actually is parameter controlSimon Wessing, Mike Preuss, Günter Rudolph. 821-828 [doi]
• Exploratory landscape analysisOlaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, Günter Rudolph. 829-836 [doi]
• Niching foundations: basin identification on fixed-property generated landscapesMike Preuss, Catalin Stoean, Ruxandra Stoean. 837-844 [doi]
• High dimensions and heavy tails for natural evolution strategiesTom Schaul, Tobias Glasmachers, Jürgen Schmidhuber. 845-852 [doi]
• Analysis of a repair mechanism for the (1, λ)-ES applied to a simple constrained problemDirk V. Arnold. 853-860 [doi]
• Mirrored sampling in evolution strategies with weighted recombinationAnne Auger, Dimo Brockhoff, Nikolaus Hansen. 861-868 [doi]
• Local-meta-model CMA-ES for partially separable functionsZyed Bouzarkouna, Anne Auger, Didier Yu Ding. 869-876 [doi]
• Using the uncertainty handling CMA-ES for finding robust optimaJohannes W. Kruisselbrink, Edgar Reehuis, André H. Deutz, Thomas Bäck, Michael Emmerich. 877-884 [doi]
• Adaptive coordinate descentIlya Loshchilov, Marc Schoenauer, Michèle Sebag. 885-892 [doi]
• On the log-normal self-adaptation of the mutation rate in binary search spacesJohannes W. Kruisselbrink, Rui Li, Edgar Reehuis, Jeroen Eggermont, Thomas Bäck. 893-900 [doi]
• A parameter-less genetic algorithm with customized crossover and mutation operatorsFarhad Nadi, Ahamad Tajudin Abdul Khader. 901-908 [doi]
• Adaptive evolutionary algorithm based on population dynamics for dynamic environmentsMaury M. Gouvea Jr., Aluizio F. R. Araújo. 909-916 [doi]
• A multiobjective genetic algorithm for automatic orthogonal graph drawingBernadete Maria de Mendonça Neta, Gustavo Henrique Diniz Araújo, Frederico Gadelha Guimarães, Renato Cardoso Mesquita. 925-932 [doi]
• Stochastic algorithms assessment using performance profilesLino A. Costa, Isabel A. Espírito-Santo, Pedro Oliveira. 933-940 [doi]
• Locating seismic-sense stations through genetic algorithm: genetic algorithmsJosafath Israel Espinosa Ramos, Roberto Antonio Vázquez Espinoza de los Monteros. 941-948 [doi]
• Adaptive and hybrid genetic approaches for estimating the camera motion from image point correspondencesFrancisco Vasconcelos, Carlos Henggeler Antunes, João P. Barreto. 949-956 [doi]
• On the deleterious effects of a priori objectives on evolution and representationBrian G. Woolley, Kenneth O. Stanley. 957-964 [doi]
• Critical factors in the performance of novelty searchSteijn Kistemaker, Shimon Whiteson. 965-972 [doi]
• Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasisAndrew M. Sutton, Darrell Whitley, Adele E. Howe. 973-980 [doi]
• Black-box complexities of combinatorial problemsBenjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen. 981-988 [doi]
• How crossover helps in pseudo-boolean optimizationTimo Kötzing, Dirk Sudholt, Madeleine Theile. 989-996 [doi]
• A surrogate-assisted linkage inference approach in genetic algorithmsTomasz Oliwa, Khaled Rasheed. 997-1004 [doi]
• Pairwise and problem-specific distance metrics in the linkage tree genetic algorithmMartin Pelikan, Mark Hauschild, Dirk Thierens. 1005-1012 [doi]
• An analysis of multi-chromosome GAs in deceptive problemsMenglin Li, Colm O Riordan, Seamus Hill. 1021-1028 [doi]
• Index-based genetic algorithm for continuous optimization problemsNi Chen, Jun Zhang. 1029-1036 [doi]
• Memory-based CHC algorithms for the dynamic traveling salesman problemAnabela Simões, Ernesto Costa. 1037-1044 [doi]
• ESDL: a simple description language for population-based evolutionary computationSteve Dower, Clinton Woodward. 1045-1052 [doi]
• Speciation in evolutionary algorithms: adaptive species discoveryAntonio Della Cioppa, Angelo Marcelli, Prisco Napoli. 1053-1060 [doi]
• Spacing memetic algorithmsDaniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. 1061-1068 [doi]
• Learning individual mating preferencesLisa M. Guntly, Daniel R. Tauritz. 1069-1076 [doi]
• A robust dynamic niching genetic clustering approach for image segmentationDongxia Chang, Yao Zhao, Yanhui Xiao. 1077-1084 [doi]
• A new differential evolution algorithm with dynamic population partition and local restartYuan-Long Li, Jun Zhang. 1085-1092 [doi]
• Multi-population differential evolution with adaptive parameter control for global optimizationWei jie Yu, Jun Zhang 0003. 1093-1098 [doi]
• Differential evolution with self adaptive local searchNasimul Noman, Danushka Bollegala, Hitoshi Iba. 1099-1106 [doi]
• Approximating n-player behavioural strategy nash equilibria using coevolutionSpyridon Samothrakis, Simon M. Lucas. 1107-1114 [doi]
• Smart use of computational resources based on contribution for cooperative co-evolutionary algorithmsMohammad Nabi Omidvar, Xiaodong Li, Xin Yao. 1115-1122 [doi]
• Iterated n-player games on small-world networksRaymond Chiong, Michael Kirley. 1123-1130 [doi]
• A cooperative coevolutionary genetic algorithm for learning bayesian network structuresArthur Carvalho. 1131-1138 [doi]
• An EA-based approach to design optimization using evidence theoryRupesh Kumar Srivastava, Kalyanmoy Deb. 1139-1146 [doi]
• Adaptive strategies applied to evolutionary search for 2D DCT cellular automata rulesGina M. B. Oliveira, Luiz G. A. Martins, Enrique Fynn. 1147-1154 [doi]
• A non-deterministic adaptive inertia weight in PSOKusum Deep, Madhuri Arya, Jagdish Chand Bansal. 1155-1162 [doi]
• An algorithm for deciding minimal cache sizes in real-time systemsAntonio Martí Campoy, Francisco Rodríguez-Ballester, Eugenio Tamura Morimitsu, Rafael Ors. 1163-1170 [doi]
• Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithmJiradej Vatanutanon, Nasimul Noman, Hitoshi Iba. 1171-1178 [doi]
• Real-space evolutionary annealingAlan J. Lockett, Risto Miikkulainen. 1179-1186 [doi]
• How hard should we run?Yun-Geun Lee, Bob McKay. 1187-1194 [doi]
• Fleet estimation for defence logistics using a multi-objective learning classifier systemKamran Shafi, Axel Bender, Hussein A. Abbass. 1195-1202 [doi]
• Interaction detection for hybrid decomposable problemsHadi Sharifi, Amin Nikanjam, Adel Torkaman Rahmani. 1203-1210 [doi]
• Towards final rule set reduction in XCS: a fuzzy representation approachFarzaneh Shoeleh, Ali Hamzeh, Sattar Hashemi. 1211-1218 [doi]
• Flexible learning of k-dependence Bayesian network classifiersArcadio Rubio, José Antonio Gámez. 1219-1226 [doi]
• PSO aided k-means clustering: introducing connectivity in k-meansMihaela Elena Breaban, Henri Luchian. 1227-1234 [doi]
• Learning cost-efficient control policies with XCSF: generalization capabilities and further improvementDidier Marin, Jérémie Decock, Lionel Rigoux, Olivier Sigaud. 1235-1242 [doi]
• Modularization of xcsf for multiple output dimensionsMartin V. Butz, Patrick O. Stalph. 1243-1250 [doi]
• Accuracy exponentiation in UCS and its effect on voting marginsTim Kovacs, Narayanan Unny Edakunni, Gavin Brown. 1251-1258 [doi]
• Semi-supervised genetic programming for classificationFilipe de Lima Arcanjo, Gisele L. Pappa, Paulo Viana Bicalho, Wagner Meira Jr., Altigran Soares da Silva. 1259-1266 [doi]
• Online, GA based mixture of experts: a probabilistic model of ucsNarayanan Unny Edakunni, Gavin Brown, Tim Kovacs. 1267-1274 [doi]
• Evolving spiking networks with variable memristorsGerard David Howard, Ella Gale, Larry Bull, Benjamin de Lacy Costello, Andrew Adamatzky. 1275-1282 [doi]
• XCS cannot learn all boolean functionsCharalambos Ioannides, Geoff Barrett, Kerstin Eder. 1283-1290 [doi]
• Modelling the initialisation stage of the ALKR representation for discrete domains and GABIL encodingMaría A. Franco, Natalio Krasnogor, Jaume Bacardit. 1291-1298 [doi]
• A genetic programming based hyper-heuristic approach for combinatorial optimisationSu Nguyen, Mengjie Zhang, Mark Johnston. 1299-1306 [doi]
• Geometric nelder-mead algorithm on the space of genetic programsAlberto Moraglio, Sara Silva. 1307-1314 [doi]
• Variance based selection to improve test set performance in genetic programmingR. Muhammad Atif Azad, Conor Ryan. 1315-1322 [doi]
• Genetic programming with a norm-referenced fitness functionGeng Li, Xiao-Jun Zeng. 1323-1330 [doi]
• Evolving ensembles in multi-objective genetic programming for classification with unbalanced dataUrvesh Bhowan, Mark Johnston, Mengjie Zhang. 1331-1338 [doi]
• A gaussian groundplan projection area model for evolving probabilistic classifiersTheodoros Theodoridis, Alexandros Agapitos, Huosheng Hu. 1339-1346 [doi]
• Drawing boundaries: using individual evolved class boundaries for binary classification problemsJeannie Fitzgerald, Conor Ryan. 1347-1354 [doi]
• Predicting problem difficulty for genetic programming applied to data classificationLeonardo Trujillo, Yuliana Martínez, Edgar Galván López, Pierrick Legrand. 1355-1362 [doi]
• Examining the landscape of semantic similarity based mutationQuang Uy Nguyen, Xuan Hoai Nguyen, Michael O Neill. 1363-1370 [doi]
• Mutation as a diversity enhancing mechanism in genetic programmingDavid Jackson. 1371-1378 [doi]
• Semantically embedded genetic programming: automated design of abstract program representationsKrzysztof Krawiec. 1379-1386 [doi]
• A comparison of GE and TAGE in dynamic environmentsEoin Murphy, Michael O Neill, Anthony Brabazon. 1387-1394 [doi]
• Reassembling operator equalisation: a secret revealedSara Silva. 1395-1402 [doi]
• Rethinking multilevel selection in genetic programmingShelly Xiaonan Wu, Wolfgang Banzhaf. 1403-1410 [doi]
• A non-destructive grammar modification approach to modularity in grammatical evolutionJohn Mark Swafford, Erik Hemberg, Michael O Neill, Miguel Nicolau, Anthony Brabazon. 1411-1418 [doi]
• Tag-based modules in genetic programmingLee Spector, Brian Martin, Kyle Harrington, Thomas Helmuth. 1419-1426 [doi]
• Evolving patches for software repairThomas Ackling, Bradley Alexander, Ian Grunert. 1427-1434 [doi]
• Morphological image enhancement procedure design by using genetic programmingJun Wang, Ying Tan. 1435-1442 [doi]
• Co-evolving robocode tanksRobin Harper. 1443-1450 [doi]
• Evolving a robust trader in a cyclic double auction marketPeter A. Whigham, Rasika Withanawasam. 1451-1458 [doi]
• Structural difficulty in estimation of distribution genetic programmingKangil Kim, MinHyeok Kim, Bob McKay. 1459-1466 [doi]
• The K landscapes: a tunably difficult benchmark for genetic programmingLeonardo Vanneschi, Mauro Castelli, Luca Manzoni. 1467-1474 [doi]
• Evolving complete robots with CPPN-NEAT: the utility of recurrent connectionsJoshua E. Auerbach, Josh C. Bongard. 1475-1482 [doi]
• Constraining connectivity to encourage modularity in HyperNEATPhillip Verbancsics, Kenneth O. Stanley. 1483-1490 [doi]
• SMCGP2: self modifying cartesian genetic programming in two dimensionsSimon Harding, Julian F. Miller, Wolfgang Banzhaf. 1491-1498 [doi]
• Using feedback in a regulatory network computational deviceRui L. Lopes, Ernesto Costa. 1499-1506 [doi]
• On the correlations between developmental diversity and genomic compositionGunnar Tufte, Stefano Nichele. 1507-1514 [doi]
• Evolved neurogenesis and synaptogenesis for robotic control: the L-brain modelMichael E. Palmer. 1515-1522 [doi]
• A novel generative encoding for evolving modular, regular and scalable networksMarcin Suchorzewski, Jeff Clune. 1523-1530 [doi]
• On the relationships between synaptic plasticity and generative systemsPaul Tonelli, Jean-Baptiste Mouret. 1531-1538 [doi]
• Enhancing es-hyperneat to evolve more complex regular neural networksSebastian Risi, Kenneth O. Stanley. 1539-1546 [doi]
• ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignmentShigeyoshi Tsutsui, Noriyuki Fujimoto. 1547-1554 [doi]
• GPU-based asynchronous particle swarm optimizationLuca Mussi, Youssef S. G. Nashed, Stefano Cagnoni. 1555-1562 [doi]
• Collaborative multi-swarm PSO for task matching using graphics processing unitsSteven Solomon, Parimala Thulasiraman, Ruppa K. Thulasiram. 1563-1570 [doi]
• Parallel divide-and-evolve: experiments with OpenMP on a multicore machineCaner Candan, Johann Dréo, Pierre Savéant, Vincent Vidal. 1571-1578 [doi]
• Effect of topology on diversity of spatially-structured evolutionary algorithmsMatteo De Felice, Sandro Meloni, Stefano Panzieri. 1579-1586 [doi]
• On the effectiveness of crossover for migration in parallel evolutionary algorithmsFrank Neumann, Pietro Simone Oliveto, Günter Rudolph, Dirk Sudholt. 1587-1594 [doi]
• Many-threaded implementation of differential evolution for the CUDA platformPavel Krömer, Václav Snásel, Jan Platos, Ajith Abraham. 1595-1602 [doi]
• Using free cloud storage services for distributed evolutionary algorithmsMaribel García Arenas, Juan Julián Merelo Guervós, Pedro A. Castillo, Juan Luís Jiménez Laredo, Gustavo Romero, Antonio Miguel Mora. 1603-1610 [doi]
• Parallel island-based multiobjectivised memetic algorithms for a 2D packing problemCarlos Segura, Eduardo Segredo, Coromoto León. 1611-1618 [doi]
• Large network analysis for fisheries management using coevolutionary genetic algorithmsGarnett Carl Wilson, Simon Harding, Orland Hoeber, Rodolphe Devillers, Wolfgang Banzhaf. 1619-1626 [doi]
• A non-dominated neighbor immune algorithm for community detection in networksMaoguo Gong, Tian Hou, Bao Fu, Licheng Jiao. 1627-1634 [doi]
• Evolutionary optimization of layouts for high density free space optical network linksSteffen Limmer, Dietmar Fey, Ulrich Lohmann, Jürgen Jahns. 1635-1642 [doi]
• Improving reputation systems for wireless sensor networks using genetic algorithmsZorana Bankovic, David Fraga, Juan Carlos Vallejo, José Manuel Moya. 1643-1650 [doi]
• An evolutionary approach to design dilation-erosion perceptrons for stock market indices forecastingRicardo Araujo Costa, Adriano L. I. Oliveira, Sérgio Soares, Silvio Romero de Lemos Meira. 1651-1658 [doi]
• Enhanced rule extraction and classification mechanism of genetic network programming for stock trading signal generationShingo Mabu, Kotaro Hirasawa. 1659-1666 [doi]
• Stock trading using linear genetic programming with multiple time framesGarnett Carl Wilson, Derek Leblanc, Wolfgang Banzhaf. 1667-1674 [doi]
• Scaling up a hybrid genetic linear programming algorithm for statistical disclosure controlMartin C. Serpell, James E. Smith, Alistair R. Clark, Andrea T. Staggemeier. 1675-1682 [doi]
• Hyperheuristic encoding scheme for multi-objective guillotine cutting problemsJésica de Armas, Gara Miranda, Coromoto León. 1683-1690 [doi]
• Coevolving collection plans for UAS constellationsDaniel W. Stouch, Ernest W. Zeidman, Marc D. Richards, Kirk D. McGraw, William J. Callahan. 1691-1698 [doi]
• An efficient evolutionary algorithm for solving incrementally structured problemsJason Ansel, Maciej Pacula, Saman P. Amarasinghe, Una-May O Reilly. 1699-1706 [doi]
• A genetic algorithm for the freight consolidation problem with one-dimensional container loadingZizhen Zhang, Hu Qin, Andrew Lim. 1707-1714 [doi]
• Coastal current prediction using CMA evolution strategiesAndrea Tettamanzi, Christel Dartigues-Pallez, Célia da Costa Pereira, Denis Pallez, Philippe Gourbesville. 1715-1722 [doi]
• Opt4J: a modular framework for meta-heuristic optimizationMartin Lukasiewycz, Michael Glaß, Felix Reimann, Jürgen Teich. 1723-1730 [doi]
• A combination of evolutionary algorithm and mathematical programming for the 3d thermal-aware floorplanning problemDavid Cuesta Gómez, José Luis Risco-Martín, José Luis Ayala, José Ignacio Hidalgo. 1731-1738 [doi]
• Optimizing ballast design of wave energy converters using evolutionary algorithmsMitchell K. Colby, Ehsan M. Nasroullahi, Kagan Tumer. 1739-1746 [doi]
• A direct optimization approach to the P300 spellerRoberto Santana, Santiago Muelas, Antonio LaTorre, Jose M. Peña. 1747-1754 [doi]
• Psychometric augmentation of an interactive genetic algorithm for optimizing cochlear implant programsSean K. R. Lineaweaver, Gregory H. Wakefield. 1755-1762 [doi]
• Quantitative modeling of customer perception from service data using evolutionary optimizationSunith Bandaru, Kalyanmoy Deb, Vineet R. Khare, Rahul Chougule. 1763-1770 [doi]
• RankDE: learning a ranking function for information retrieval using differential evolutionDanushka Bollegala, Nasimul Noman, Hitoshi Iba. 1771-1778 [doi]
• Evolutionary strategies for identification and validation of material model parameters for forming simulationsThomas Bäck, Lutz Keßler, Ingo Heinle. 1779-1786 [doi]
• Application of evolutionary algorithms in detecting SMS spam at access layerM. Zubair Rafique, Nasser Alrayes, Muhammad Khurram Khan. 1787-1794 [doi]
• Using evolutionary learning classifiers to do MobileSpam (SMS) filteringMuhammad Bilal Junaid, Muddassar Farooq. 1795-1802 [doi]
• GPU-accelerated high-accuracy molecular docking using guided differential evolution: real world applicationsMartin Simonsen, Christian N. S. Pedersen, Mikael H. Christensen, René Thomsen. 1803-1810 [doi]
• Using differential evolution to optimize learning from signals and enhance network securityPaul K. Harmer, Michael A. Temple, Mark A. Buckner, Ethan Farquahar. 1811-1818 [doi]
• Multi-objective optimization of dynamic memory managers using grammatical evolutionJ. Manuel Colmenar, José L. Risco-Martín, David Atienza, José Ignacio Hidalgo. 1819-1826 [doi]
• Multiple objective optimisation applied to route planningAntony Waldock, David Corne. 1827-1834 [doi]
• Spanning the pareto front of a counter radar detection problemHans Jonas Fossum Moen, Harald Hovland. 1835-1842 [doi]
• Multi-objective design and analysis of robot gripper configurations using an evolutionary-classical approachRituparna Datta, Kalyanmoy Deb. 1843-1850 [doi]
• Transition coverage testing for simulink/stateflow models using messy genetic algorithmsJungsup Oh, Mark Harman, Shin Yoo. 1851-1858 [doi]
• Search-based software testing and test data generation for a dynamic programming languageStefan Mairhofer, Robert Feldt, Richard Torkar. 1859-1866 [doi]
• Establishing integration test orders of classes with several coupling measuresWesley Klewerton Guez Assunção, Thelma Elita Colanzi, Aurora Trinidad Ramirez Pozo, Silvia Regina Vergilio. 1867-1874 [doi]
• A multi-objective evolutionary algorithm to obtain test cases with variable lengthsThaise Yano, Eliane Martins, Fabiano Luis de Sousa. 1875-1882 [doi]
• Multiobjective simulation optimisation in software project managementDaniel Rodríguez, Mercedes Ruiz Carreira, José C. Riquelme, Rachel Harrison. 1883-1890 [doi]
• QoS-based service optimization using differential evolutionFlorin-Claudiu Pop, Denis Pallez, Marcel Cremene, Andrea Tettamanzi, Mihai Suciu, Mircea-Florin Vaida. 1891-1898 [doi]
• Evolving relationships between social networks and stakeholder involvement in software projectsSoo Ling Lim, Peter J. Bentley. 1899-1906 [doi]
• Searching for invariants using genetic programming and mutation testingSam Ratcliff, David Robert White, John A. Clark. 1907-1914 [doi]
• Using multi-objective metaheuristics to solve the software project scheduling problemJ. Francisco Chicano, Francisco Luna, Antonio J. Nebro, Enrique Alba. 1915-1922 [doi]
• Finding short counterexamples in promela models using estimation of distribution algorithmsJan Staunton, John A. Clark. 1923-1930 [doi]
• GA-FreeCell: evolving solvers for the game of FreeCellAchiya Elyasaf, Ami Hauptman, Moshe Sipper. 1931-1938 [doi]
• Self-adaptive mutation in the differential evolutionRodrigo César Pedrosa Silva, Rodolfo Ayala Lopes, Frederico Gadelha Guimarães. 1939-1946 [doi]
• Towards the development of self-ant systemsJorge Tavares, Francisco Baptista Pereira. 1947-1954 [doi]
• DAMS: distributed adaptive metaheuristic selectionBilel Derbel, Sébastien Vérel. 1955-1962 [doi]
• Generalized adaptive pursuit algorithm for genetic pareto local search algorithmsMadalina M. Drugan, Dirk Thierens. 1963-1970 [doi]
• Policy learning in resource-constrained optimizationRichard Allmendinger, Joshua Knowles. 1971-1978 [doi]
• The road to VEGAS: guiding the search over neutral networksMarie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, Sébastien Vérel. 1979-1986 [doi]
• Adaptive iterated local search for cross-domain optimisationEdmund K. Burke, Michel Gendreau, Gabriela Ochoa, James D. Walker. 1987-1994 [doi]
• Tuned data mining: a benchmark study on different tunersWolfgang Konen, Patrick Koch, Oliver Flasch, Thomas Bartz-Beielstein, Martina Friese, Boris Naujoks. 1995-2002 [doi]
• Markov chain hyper-heuristic (MCHH): an online selective hyper-heuristic for multi-objective continuous problemsKent McClymont, Edward Keedwell. 2003-2010 [doi]
• Policy matrix evolution for generation of heuristicsEnder Özcan, Andrew J. Parkes. 2011-2018 [doi]
• Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS frameworkJérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle. 2019-2026 [doi]
• Exact computation of the expectation curves of the bit-flip mutation using landscapes theoryJ. Francisco Chicano, Enrique Alba. 2027-2034 [doi]
• Unbiased black box search algorithmsJonathan E. Rowe, Michael D. Vose. 2035-2042 [doi]
• Too fast unbiased black-box algorithmsBenjamin Doerr, Timo Kötzing, Carola Winzen. 2043-2050 [doi]
• An analysis on recombination in multi-objective evolutionary optimizationChao Qian, Yang Yu, Zhi-Hua Zhou. 2051-2058 [doi]
• The effects of selection on noisy fitness optimizationSergiu Goschin, Michael L. Littman, David H. Ackley. 2059-2066 [doi]
• Domain specific analysis and modeling of optimal elimination of fitness functions with optimal samplingGautham Anil, R. Paul Wiegand. 2067-2074 [doi]
• Fitness-levels for non-elitist populationsPer Kristian Lehre. 2075-2082 [doi]
• Sharp bounds by probability-generating functions and variable driftBenjamin Doerr, Mahmoud Fouz, Carsten Witt. 2083-2090 [doi]
• PAC learning and genetic programmingTimo Kötzing, Frank Neumann, Reto Spöhel. 2091-2096 [doi]