GECCO 2012: Philadelphia, PA, USA

Track: ant colony optimization and swarm intelligence

• Ashraf M. Abdelbar:
  Is there a computational advantage to representing evaporation rate in ant colony optimization as a gaussian random variable? 1-8
  
• Ye Chen, Lawrence J. Mazlack, Long J. Lu:
  Learning fuzzy cognitive maps from data by ant colony optimization. 9-16
  
• Benjamin Doerr, Ashish Hota, Timo Kötzing:
  Ants easily solve stochastic shortest path problems. 17-24
  
• José García-Nieto, Enrique Alba:
  Why six informants is optimal in PSO. 25-32
  
• Ana Cristina B. Kochem Vendramin, Anelise Munaretto, Myriam Regattieri de Biase da Silva Delgado, Aline Carneiro Viana:
  CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networks. 33-40
  
• Nuno C. Lourenço, Francisco Baptista Pereira:
  DACCO: a discrete ant colony algorithm to cluster geometry optimization. 41-48
  
• Matthew Medland, Fernando E. B. Otero:
  A study of different quality evaluation functions in the cAnt-Miner(PB) classification algorithm. 49-56
  
• Angel Eduardo Muñoz Zavala, Evelyn Jade Hernández Ramos:
  Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO. 57-64
  
• Grigoris S. Piperagkas, George K. Georgoulas, Konstantinos E. Parsopoulos, Chrysostomos D. Stylios, Aristidis Likas:
  Integrating particle swarm optimization with reinforcement learning in noisy problems. 65-72
  
• Eduardo Vellasques, Robert Sabourin, Eric Granger:
  Gaussian mixture modeling for dynamic particle swarm optimization of recurrent problems. 73-80
  
• Bing Xue, Mengjie Zhang, Will N. Browne:
  Multi-objective particle swarm optimisation (PSO) for feature selection. 81-88
  

Track: artificial life/robotics/evolvable hardware

• Leo Cazenille, Nicolas Bredeche, Heiko Hamann, Jürgen Stradner:
  Impact of neuron models and network structure on evolving modular robot neural network controllers. 89-96
  
• John Doucette, Peter Lichodzijewski, Malcolm I. Heywood:
  Hierarchical task decomposition through symbiosis in reinforcement learning. 97-104
  
• Kathryn Hardey, Eren Corapcioglu, Molly Mattis, Mark Goadrich, Matthew C. Jadud:
  Exploring and evolving process-oriented control for real and virtual fire fighting robots. 105-112
  
• Benjamin Inden:
  Open-ended coevolution and the emergence of complex irreducible functional units in iterated number sequence games. 113-120
  
• Francis Jeanson, Anthony White:
  Evolving axonal delay neural networks for robot control. 121-128
  
• Soo Ling Lim, Peter J. Bentley:
  How to be a successful app developer: lessons from the simulation of an app ecosystem. 129-136
  
• Yan Meng, Hongliang Guo:
  Evolving network motifs based morphogenetic approach for self-organizing robotic swarms. 137-144
  
• Jared M. Moore, Philip K. McKinley:
  Evolving flexible joint morphologies. 145-152
  
• Michael Solomon, Terence Soule, Robert B. Heckendorn:
  A comparison of a communication strategies in cooperative learning. 153-160
  
• Ivan Tanev, Tüze Kuyucu, Katsunori Shimohara:
  On the cumulative effect of bloat and genetic transposition on the efficiency of incremental evolution of snake-like robot. 161-168
  

Track: bioinformatics, computational, systems and synthetic biology

• Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling:
  Efficient algorithms for extracting biological key pathways with global constraints. 169-176
  
• David Marco, Carron Shankland, David Cairns:
  Evolving Bio-PEPA process algebra models using genetic programming. 177-184
  
• Mariana Recamonde Mendoza, Fabrício Martins Lopes, Ana Lúcia C. Bazzan:
  Reverse engineering of GRNs: an evolutionary approach based on the tsallis entropy. 185-192
  
• Clara Pizzuti, Simona E. Rombo:
  Experimental evaluation of topological-based fitness functions to detect complexes in PPI networks. 193-200
  
• Jesun Sahariar Firoz, M. Sohel Rahman, Tanay Kumar Saha:
  Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data. 201-208
  
• Nazar Zaki, Jose Berengueres, Dmitry Efimov:
  ProRank: a method for detecting protein complexes. 209-216
  

Track: digital entertainment technologies and arts

• Matthew Hausknecht, Piyush Khandelwal, Risto Miikkulainen, Peter Stone:
  HyperNEAT-GGP: a hyperNEAT-based atari general game player. 217-224
  
• Gregory S. Hornby, Josh C. Bongard:
  Accelerating human-computer collaborative search through learning comparative and predictive user models. 225-232
  
• Penousal Machado, Luís Pereira:
  Photogrowth: non-photorealistic renderings through ant paintings. 233-240
  

Track: estimation of distribution algorithms

• Peter A. N. Bosman, Tanja Alderliesten:
  Incremental gaussian model-building in multi-objective EDAs with an application to deformable image registration. 241-248
  
• Alexander E. I. Brownlee, John A. W. McCall, Martin Pelikan:
  Influence of selection on structure learning in markov network EDAs: an empirical study. 249-256
  
• Wei-Ming Chen, Chung-Yu Shao, Po-Chun Hsu, Tian-Li Yu:
  A test problem with adjustable degrees of overlap and conflict among subproblems. 257-264
  
• David Iclanzan:
  Higher-order linkage learning in the ECGA. 265-272
  
• Martin Pelikan, Mark Hauschild:
  Distance-based bias in model-directed optimization of additively decomposable problems. 273-280
  
• Sergio Rojas Galeano, Nestor Rodriguez:
  A memory efficient and continuous-valued compact EDA for large scale problems. 281-288
  
• Dirk Thierens, Peter A. N. Bosman:
  Predetermined versus learned linkage models. 289-296
  

Track: evolution strategies and evolutionary programming

• Dirk V. Arnold, Nikolaus Hansen:
  A (1+1)-CMA-ES for constrained optimisation. 297-304
  
• Hans-Georg Beyer, Michael Hellwig:
  Mutation strength control by meta-ES on the sharp ridge. 305-312
  
• Bernd Bischl, Olaf Mersmann, Heike Trautmann, Mike Preuß:
  Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. 313-320
  
• Ilya Loshchilov, Marc Schoenauer, Michèle Sebag:
  Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategy. 321-328
  
• Tom Schaul:
  Natural evolution strategies converge on sphere functions. 329-336
  

Track: evolutionary combinatorial optimization and metaheuristics

• Ignacio Araya, Leslie Pérez Cáceres, María-Cristina Riff:
  Towards a population-based framework for improving stochastic local search algorithms. 337-344
  
• Amine M. Boumaza, Armelle Brun:
  From neighbors to global neighbors in collaborative filtering: an evolutionary optimization approach. 345-352
  
• David Chalupa:
  On the efficiency of an order-based representation in the clique covering problem. 353-360
  
• Jaeun Choi, Yourim Yoon, Byung Ro Moon:
  An efficient genetic algorithm for subgraph isomorphism. 361-368
  
• Fabio Daolio, Sébastien Vérel, Gabriela Ochoa, Marco Tomassini:
  Local optima networks and the performance of iterated local search. 369-376
  
• Douglas Guimarães Macharet, Armando Alves Neto, Vilar Fiuza da Camara Neto, Mario Fernando Montenegro Campos:
  An evolutionary approach for the dubins' traveling salesman problem with neighborhoods. 377-384
  
• Wesam Herbawi, Michael Weber:
  A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows. 385-392
  
• Bin Hu, Günther R. Raidl:
  An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. 393-400
  
• Ahmed Kattan, Mohammed Arif:
  PSO based on surrogate modeling as meta-search to optimise evolutionary algorithms parameters. 401-408
  
• Jorge H. Moreno-Scott, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
  Challenging heuristics: evolving binary constraint satisfaction problems. 409-416
  
• Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce Leon Ferreira de Carvalho:
  A hybrid heuristic for the k-medoids clustering problem. 417-424
  
• Bo Song, Victor Li:
  A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problem. 425-432
  
• Andrew M. Sutton, Jareth Day, Frank Neumann:
  A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. 433-440
  
• Qiao Zhang, Hervé Manier, Marie-Ange Manier:
  A hybrid metaheuristic algorithm for flexible job-shop scheduling problems with transportation constraints. 441-448
  

Track: evolutionary multiobjective optimization

• Wahabou Abdou, Christelle Bloch, Damien Charlet, François Spies:
  Adaptive multi-objective genetic algorithm using multi-pareto-ranking. 449-456
  
• Karl Bringmann, Tobias Friedrich:
  Convergence of hypervolume-based archiving algorithms ii: competitiveness. 457-464
  
• Dimo Brockhoff, Tobias Wagner, Heike Trautmann:
  On the properties of the R2 indicator. 465-472
  
• Mario Garza-Fabre, Gregorio Toscano Pulido, Eduardo Rodriguez-Tello:
  Locality-based multiobjectivization for the HP model of protein structure prediction. 473-480
  
• Hisao Ishibuchi, Masakazu Yamane, Yusuke Nojima:
  Effects of discrete objective functions with different granularities on the search behavior of EMO algorithms. 481-488
  
• Réka Nagy, Mihai Alexandru Suciu, D. Dumitrescu:
  Lorenz equilibrium: equitability in non-cooperative games. 489-496
  
• Dung H. Phan, Junichi Suzuki, Isao Hayashi:
  Leveraging indicator-based ensemble selection in evolutionary multiobjective optimization algorithms. 497-504
  
• Cynthia A. Rodríguez Villalobos, Carlos A. Coello Coello:
  A new multi-objective evolutionary algorithm based on a performance assessment indicator. 505-512
  
• Rui Wang, Robin C. Purshouse, Peter J. Fleming:
  Local preference-inspired co-evolutionary algorithms. 513-520
  

Track: generative and developmental systems

• Joshua E. Auerbach, Josh C. Bongard:
  On the relationship between environmental and morphological complexity in evolved robots. 521-528
  
• Jacob Beal, Hala Mostafa, Annan Mozeika, Benjamin Axelrod, Aaron Adler, Gretchen Markiewicz, Kyle Usbeck:
  A manifold operator representation for adaptive design. 529-536
  
• Sylvain Cussat-Blanc, Jordan Pollack:
  A cell-based developmental model to generate robot morphologies. 537-544
  
• Jan Drchal, Miroslav Snorek:
  Distance measures for HyperGP with fitness sharing. 545-552
  
• Jose D. Fernández, Francisco J. Vico, René Doursat:
  Complex and diverse morphologies can develop from a minimal genomic model. 553-560
  
• Michal Joachimczak, Borys Wróbel:
  Co-evolution of morphology and control of soft-bodied multicellular animats. 561-568
  
• Daniel Richards, Nick Dunn, Martyn Amos:
  An evo-devo approach to architectural design. 569-576
  
• Hiroki Sayama:
  Morphologies of self-organizing swarms in 3D swarm chemistry. 577-584
  

Track: genetic algorithms

• Peter A. N. Bosman, Dirk Thierens:
  Linkage neighbors, optimal mixing and forced improvements in genetic algorithms. 585-592
  
• Drue Coles:
  Efficient filters for the simulated evolution of small sorting networks. 593-600
  
• Robert Collier, Mark Wineberg:
  An empirical approach to the measurement of interchromosomal distances in the genetic algorithm. 601-608
  
• Robert Collier, Christian Fobel, Gary William Grewal, Mark Wineberg:
  Depictions of genotypic space for evaluating the suitability of different recombination operators. 609-616
  
• Andrea De Lucia, Massimiliano Di Penta, Rocco Oliveto, Annibale Panichella:
  Estimating the evolution direction of populations to improve genetic algorithms. 617-624
  
• Brian W. Goldman, Daniel R. Tauritz:
  Linkage tree genetic algorithms: variants and analysis. 625-632
  
• Mark Hauschild, Sanjiv Bhatia, Martin Pelikan:
  Image segmentation using a genetic algorithm and hierarchical local search. 633-640
  
• Hsuan Lee, Tian-Li Yu:
  Off-line building block identification: detecting building blocks directly from fitness without genetic algorithms. 641-648
  
• Alberto Moraglio, Dirk Sudholt:
  Runtime analysis of convex evolutionary search. 649-656
  
• Cristian Rotaru, Octav Brudaru:
  Dynamic segregative genetic algorithm for optimizing the variable ordering of ROBDDs. 657-664
  
• Briseida Sarasola, Enrique Alba:
  How long should we run in dynamic optimization? 665-672
  
• Anabela Simões, Ernesto Costa:
  Enhancing the virtual loser genetic algorithm for dynamic environments. 673-680
  
• Symone Soares, Carlos Antunes, Rui Araújo:
  A genetic algorithm for designing neural network ensembles. 681-688
  
• Dirk Sudholt:
  Crossover speeds up building-block assembly. 689-702
  

Track: genetic programming

• Aaron Atwater, Malcolm I. Heywood, A. Nur Zincir-Heywood:
  GP under streaming data constraints: a case for pareto archiving? 703-710
  
• Alexander Bailey, Mario Ventresca, Beatrice M. Ombuki-Berman:
  Automatic generation of graph models for complex networks by genetic programming. 711-718
  
• Jeffrey K. Bassett, Uday Kamath, Kenneth A. De Jong:
  A new methodology for the GP theory toolbox. 719-726
  
• Mauro Castelli, Luca Manzoni, Leonardo Vanneschi:
  Parameter tuning of evolutionary reactions systems. 727-734
  
• Theodore W. Cornforth, Hod Lipson:
  Symbolic regression of multiple-time-scale dynamical systems. 735-742
  
• Jeannie Fitzgerald, Conor Ryan:
  Exploring boundaries: optimising individual class boundaries for binary classification problem. 743-750
  
• Simon Harding, Vincent Graziano, Jürgen Leitner, Jürgen Schmidhuber:
  MT-CGP: mixed type cartesian genetic programming. 751-758
  
• Robin Harper:
  Spatial co-evolution: quicker, fitter and less bloated. 759-766
  
• Erik Hemberg, Kalyan Veeramachaneni, James McDermott, Constantin Berzan, Una-May O'Reilly:
  An investigation of local patterns for estimation of distribution genetic programming. 767-774
  
• Muhammad Rezaul Karim, Conor Ryan:
  Sensitive ants are sensible ants. 775-782
  
• Krzysztof Krawiec:
  On relationships between semantic diversity, complexity and modularity of programming tasks. 783-790
  
• James 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:
  Genetic programming needs better benchmarks. 791-798
  
• Frank Neumann:
  Computational complexity analysis of multi-objective genetic programming. 799-806
  
• Dao Ngoc Phong, Nguyen Xuan Hoai, Robert Ian (Bob) McKay, Constantin Siriteanu, Nguyen Quang Uy, Namyong Park:
  Evolving the best known approximation to the Q function. 807-814
  
• Lee Spector, Kyle Ira Harrington, Thomas Helmuth:
  Tag-based modularity in tree-based genetic programming. 815-822
  
• John Mark Swafford, Miguel Nicolau, Erik Hemberg, Michael O'Neill, Anthony Brabazon:
  Comparing methods for module identification in grammatical evolution. 823-830
  
• Thomas Weise, Alexandre Devert, Ke Tang:
  A developmental solution to (dynamic) capacitated arc routing problems using genetic programming. 831-838
  

Track: genetics based machine learning

• Toktam Ebadi, Mengjie Zhang, Will N. Browne:
  XCS-based versus UCS-based feature pattern classification system. 839-846
  
• María A. Franco, Natalio Krasnogor, Jaume Bacardit:
  Post-processing operators for decision lists. 847-854
  
• Wenlong Fu, Mark Johnston, Mengjie Zhang:
  Genetic programming for edge detection using blocks to extract features. 855-862
  
• Muhammad Iqbal, Will N. Browne, Mengjie Zhang:
  Extracting and using building blocks of knowledge in learning classifier systems. 863-870
  
• Jan Kneissler, Patrick O. Stalph, Jan Drugowitsch, Martin V. Butz:
  Filtering sensory information with XCSF: improving learning robustness and control performance. 871-878
  
• Julien-Charles Levesque, Audrey Durand, Christian Gagné, Robert Sabourin:
  Multi-objective evolutionary optimization for generating ensembles of classifiers in the ROC space. 879-886
  
• Steven Loscalzo, Robert Wright, Kevin Acunto, Lei Yu:
  Sample aware embedded feature selection for reinforcement learning. 887-894
  
• Syahaneim Marzukhi, Will N. Browne, Mengjie Zhang:
  Two-cornered learning classifier systems for pattern generation and classification. 895-902
  
• Hirotaka Moriguchi, Shinichi Honiden:
  CMA-TWEANN: efficient optimization of neural networks via self-adaptation and seamless augmentation. 903-910
  
• Patrick O. Stalph, Martin V. Butz:
  Guided evolution in XCSF. 911-918
  
• Wesley Tansey, Eliana Feasley, Risto Miikkulainen:
  Accelerating evolution via egalitarian social learning. 919-926
  
• Ryan J. Urbanowicz, Ambrose Granizo-Mackenzie, Jason H. Moore:
  Instance-linked attribute tracking and feedback for michigan-style supervised learning classifier systems. 927-934
  

Track: integrative genetic and evolutionary computation

• John A. Doucette, Darren Abramson:
  Automated mechanism design with co-evolutionary hierarchical genetic programming techniques. 935-942
  
• Daniel Hennes, Daan Bloembergen, Michael Kaisers, Karl Tuyls, Simon Parsons:
  Evolutionary advantage of foresight in markets. 943-950
  
• Ricardo Landa Becerra, Yazmin Rojas, Gregorio Toscano Pulido:
  An approach for estimating separability and its application on high dimensional optimization. 951-958
  
• Claire Le Goues, Westley Weimer, Stephanie Forrest:
  Representations and operators for improving evolutionary software repair. 959-966
  
• Daniel Le Ly, Ashutosh Saxena, Hod Lipson:
  Co-evolutionary predictors for kinematic pose inference from RGBD images. 967-974
  
• Jinghui Zhong, Jun Zhang:
  SDE: a stochastic coding differential evolution for global optimization. 975-982
  

Track: parallel evolutionary systems

• Nikolaos Chatzinikolaou, David Robertson:
  The use of reputation as noise-resistant selection bias in a co-evolutionary multi-agent system. 983-990
  
• A. K. Qin, Federico Raimondo, Florence Forbes, Yew-Soon Ong:
  An improved CUDA-based implementation of differential evolution on GPU. 991-998
  
• Shuai Shao, Xiyang Liu, Mingyuan Zhou, Jiguo Zhan, Xin Liu, Yanli Chu, Hao Chen:
  A GPU-based implementation of an enhanced GEP algorithm. 999-1006
  
• Mouadh Yagoubi, Marc Schoenauer:
  Asynchronous master/slave moeas and heterogeneous evaluation costs. 1007-1014
  

Track: real world applications

• Adrian K. Agogino, Chris HolmesParker, Kagan Tumer:
  Evolving distributed resource sharing for cubesat constellations. 1015-1022
  
• Adrian K. Agogino, Chris HolmesParker, Kagan Tumer:
  Evolving large scale UAV communication system. 1023-1030
  
• Arbab Masood Ahmad, Gul Muhammad Khan, Sahibzada Ali Mahmud, Julian Francis Miller:
  Breast cancer detection using cartesian genetic programming evolved artificial neural networks. 1031-1038
  
• Bradley Alexander, Stephan Thiel, Jared Peacock:
  Application of evolutionary methods to 3D geoscience modelling. 1039-1046
  
• Markus Beck, Michael de Paly, Jozsef Hecht-Méndez, Peter Bayer, Andreas Zell:
  Evaluation of the performance of evolutionary algorithms for optimization of low-enthalpy geothermal heating plants. 1047-1054
  
• António Canelas, Rui Ferreira Neves, Nuno Horta:
  A new SAX-GA methodology applied to investment strategies optimization. 1055-1062
  
• Wei-neng Chen, Jun Zhang, Jinghui Zhong:
  A preference-based bi-objective approach to the payment scheduling negotiation problem with the extended r-dominance and NSGA-ii. 1063-1070
  
• Christine Chou, Steven Orla Kimbrough, John Sullivan-Fedock, C. Jason Woodard, Frederic H. Murphy:
  Using interactive evolutionary computation (IEC) with validated surrogate fitness functions for redistricting. 1071-1078
  
• Alexander W. Churchill, Phil Husbands, Andrew Philippides:
  Metaheuristic approaches to tool selection optimisation. 1079-1086
  
• Daniel Hernández, Gustavo Olague, Eddie Clemente, León Dozal:
  Evolving a conspicuous point detector based on an artificial dorsal stream: SLAM system. 1087-1094
  
• Martin Holena, David Linke, Lukás Bajer:
  Surrogate modeling in the evolutionary optimization of catalytic materials. 1095-1102
  
• Taras Kowaliw, Wolfgang Banzhaf:
  The unconstrained automated generation of cell image features for medical diagnosis. 1103-1110
  
• Joseph S. Krupa, Somdeb Chatterjee, Ethan Eldridge, Donna M. Rizzo, Margaret J. Eppstein:
  Evolutionary feature selection for classification: a plug-in hybrid vehicle adoption application. 1111-1118
  
• Nuno C. Lourenço, Nuno Horta:
  GENOM-POF: multi-objective evolutionary synthesis of analog ICs with corners validation. 1119-1126
  
• Ricardo Martins, Nuno C. Lourenço, Nuno Horta:
  LAYGEN II: automatic analog ICs layout generator based on a template approach. 1127-1134
  
• Daniel E. McCarney, Sheridan Houghten, Brian J. Ross:
  Evolutionary approaches to the generation of optimal error correcting codes. 1135-1142
  
• Philipp Nebel, Gunther Richter, Karsten Weicker:
  Multi-container loading with non-convex 3D shapes using a GA/TS hybrid. 1143-1150
  
• Omar Paranaiba Vilela Neto, André S. Pimentel, Marco Aurélio Cavalcanti Pacheco, Ênio Frota da Silveira:
  Evolutionary algorithms applied to elucidate ionic water cluster structure formation. 1151-1158
  
• Roberto Santana, Laurent Bonnet, Jozef Legény, Anatole Lécuyer:
  Introducing the use of model-based evolutionary algorithms for EEG-based motor imagery classification. 1159-1166
  
• Robert Elliott Smith, Muhammad Shakir Hussain:
  Hybrid metaheuristic particle filters for stochastic volatility estimation. 1167-1174
  
• Forrest Stonedahl, Susa H. Stonedahl:
  Darwinian rivers: evolving stream topographies to match hyporheic residence time distributions. 1175-1182
  
• Rui-tian Xu, Jun Zhang:
  Estimating markov switching model using differential evolution algorithm in prospective infectious disease outbreak detection. 1183-1190
  
• Bo Yang, Liang Guang, Tero Säntti, Juha Plosila:
  t(k)-SA: accelerated simulated annealing algorithm for application mapping on networks-on-chip. 1191-1198
  
• Jinghui Zhong, Jun Zhang:
  Ant colony optimization algorithm for lifetime maximization in wireless sensor network with mobile sink. 1199-1204
  

Track: search-based software engineering

• Márcio de Oliveira Barros:
  An analysis of the effects of composite objectives in multiobjective software module clustering. 1205-1212
  
• Javier Ferrer, Peter M. Kruse, J. Francisco Chicano, Enrique Alba:
  Evolutionary algorithm for prioritized pairwise test data generation. 1213-1220
  
• Leandro L. Minku, Dirk Sudholt, Xin Yao:
  Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design. 1221-1228
  
• Josh L. Wilkerson, Daniel R. Tauritz, James M. Bridges:
  Multi-objective coevolutionary automated software correction. 1229-1236
  

Track: self-* search

• Rodrigo C. Barros, Márcio P. Basgalupp, André Carlos Ponce Leon Ferreira de Carvalho, Alex Alves Freitas:
  A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithms. 1237-1244
  
• Jürgen Branke, Jawad Asem Elomari:
  Meta-optimization for parameter tuning with a flexible computing budget. 1245-1252
  
• Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
  A dynamic island model for adaptive operator selection. 1253-1260
  
• Houda Derbel, Bilel Derbel:
  On neighborhood tree search. 1261-1268
  
• José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Ender Özcan, Andrew J. Parkes:
  Improving the performance of vector hyper-heuristics through local search. 1269-1276
  
• Nadarajen Veerapen, Jorge Maturana, Frédéric Saubion:
  An exploration-exploitation compromise-based adaptive operator selection for local search. 1277-1284
  
• Wei-jie Yu, Jun Zhang:
  Adaptive differential evolution with optimization state estimation. 1285-1292
  

Track: theory

• Youhei Akimoto:
  Analysis of a natural gradient algorithm on monotonic convex-quadratic-composite functions. 1293-1300
  
• J. Francisco Chicano, Darrell Whitley, Enrique Alba:
  Exact computation of the expectation curves for uniform crossover. 1301-1308
  
• Benjamin Doerr, Carola Winzen:
  Reducing the arity in unbiased black-box complexity. 1309-1316
  
• Benjamin Doerr, Sebastian Pohl:
  Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. 1317-1324
  
• Thomas Jansen, Christine Zarges:
  Fixed budget computations: a different perspective on run time analysis. 1325-1332
  
• Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly:
  The max problem revisited: the importance of mutation in genetic programming. 1333-1340
  
• Pietro Simone Oliveto, Carsten Witt:
  On the analysis of the simple genetic algorithm. 1341-1348
  
• Jonathan E. Rowe, Dirk Sudholt:
  The choice of the offspring population size in the (1, λ) EA. 1349-1356
  
• Darrell Whitley, Wenxiang Chen:
  Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. 1357-1364
  

Last update Sat May 18 09:55:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page