• 
  Mike Cattolico (Ed.): Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006. ACM 2006 ISBN 1-59593-186-4

Ant colony optimization and swarm intelligence: papers

• 
  Stefan Bird, Xiaodong Li: Adaptively choosing niching parameters in a PSO. 3-10
• 
  Thang Nguyen Bui, Catherine M. Zrncic: An ant-based algorithm for finding degree-constrained minimum spanning tree. 11-18
• 
  Thang Nguyen Bui, ThanhVu H. Nguyen: An agent-based algorithm for generalized graph colorings. 19-26
• 
  Allen Chan, Alex Alves Freitas: A new ant colony algorithm for multi-label classification with applications in bioinfomatics. 27-34
• 
  Elon Santos Correa, Alex Alves Freitas, Colin G. Johnson: A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set. 35-42
• 
  James Smaldon, Alex Alves Freitas: A new version of the ant-miner algorithm discovering unordered rule sets. 43-50
• 
  Xiaodong Li, Jürgen Branke, Tim Blackwell: Particle swarm with speciation and adaptation in a dynamic environment. 51-58
• 
  Christopher K. Monson, Kevin D. Seppi: Adaptive diversity in PSO. 59-66
• 
  Srinivas Pasupuleti, Roberto Battiti: The gregarious particle swarm optimizer (G-PSO). 67-74
• 
  Andrew M. Sutton, Darrell Whitley, Monte Lunacek, Adele E. Howe: PSO and multi-funnel landscapes: how cooperation might limit exploration. 75-82

Ant colony optimization and swarm intelligence: posters

• 
  Ming-chung Jian, Ying-Ping Chen: Introducing recombination with dynamic linkage discovery to particle swarm optimization. 85-86
• 
  Matteo Matteucci, Lorenzo Mussone: Ant colony optimization technique for equilibrium assignment in congested transportation networks. 87-88
• 
  Margarita Reyes Sierra, Carlos A. Coello Coello: Dynamic fitness inheritance proportion for multi-objective particle swarm optimization. 89-90
• 
  William A. Tozier, Michael R. Chesher, Tejinderpal S. Devgan: The Brueckner network: an immobile sorting swarm. 91-92

Artificial immune systems: papers

• 
  Werner Dilger, Steve Strangfeld: Properties of the bersini experiment on self-assertion. 95-102
• 
  Kenneth S. Edge, Gary B. Lamont, Richard A. Raines: A retrovirus inspired algorithm for virus detection & optimization. 103-110
• 
  Zhou Ji, Dipankar Dasgupta: Applicability issues of the real-valued negative selection algorithms. 111-118
• 
  Marek Ostaszewski, Franciszek Seredynski, Pascal Bouvry: Immune anomaly detection enhanced with evolutionary paradigms. 119-126

Artificial immune systems: posters

• 
  Andreas Pietzowski, Wolfgang Trumler, Theo Ungerer: An artificial immune system and its integration into an organic middleware for self-protection. 129-130
• 
  Stefan Schadwinkel, Werner Dilger: A dynamic approach to artificial immune systems utilizing neural networks. 131-132

Artificial life, evolutionary robotics, adaptive behavior: papers

• 
  Gregory J. Barlow, Choong K. Oh: Robustness analysis of genetic programming controllers for unmanned aerial vehicles. 135-142
• 
  Josh Jones, Terry Soule: Comparing genetic robustness in generational vs. steady state evolutionary algorithms. 143-150
• 
  DaeEun Kim: Memory analysis and significance test for agent behaviours. 151-158
• 
  Michael Kirley: Dominance hierarchies and social diversity in multi-agent systems. 159-166
• 
  Heejin Lim, Yoonsuck Choe: Facilitating neural dynamics for delay compensation and prediction in evolutionary neural networks. 167-174
• 
  J. J. McDowell, Paul L. Soto, Jesse Dallery, Saule Kulubekova: A computational theory of adaptive behavior based on an evolutionary reinforcement mechanism. 175-182
• 
  Volker Nannen, A. E. Eiben: A method for parameter calibration and relevance estimation in evolutionary algorithms. 183-190
• 
  Gustavo Olague, Cesar Puente: Parisian evolution with honeybees for three-dimensional reconstruction. 191-198
• 
  Stephan Otto, Stefan Kirn: Adaption in distributed systems: an evolutionary approach. 199-206
• 
  Joshua L. Payne, Margaret J. Eppstein: Emergent mating topologies in spatially structured genetic algorithms. 207-214
• 
  Ehud Schlessinger, Peter J. Bentley, R. Beau Lotto: Modular thinking: evolving modular neural networks for visual guidance of agents. 215-222
• 
  Xue Zhong, Terence Soule: Growth of self-canceling code in evolutionary systems. 223-228

Genetic algorithms: posters

• 
  Jason Amunrud, Bryant A. Julstrom: Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. 1395-1396
• 
  Demet Ayvaz, Haluk Topcuoglu, Fikret S. Gürgen: A comparative study of evolutionary optimization techniques in dynamic environments. 1397-1398
• 
  Yossi Borenstein, Riccardo Poli: The no free lunch and realistic search algorithms. 1399-1400
• 
  Yossi Borenstein, Riccardo Poli: Classes of problems in the black box scenario. 1401-1402
• 
  Marco Carpentieri, Vito Fedullo: A genetic model based on simulated crossover of quaternary genes for quadratic fitness. 1403-1404
• 
  Rachel Cavill, Stephen L. Smith, Andy M. Tyrrell: Variable length genetic algorithms with multiple chromosomes on a variant of the Onemax problem. 1405-1406
• 
  Justin Collins, David Joslin: Improving genetic algorithm performance with intelligent mappings from chromosomes to solutions. 1407-1408
• 
  Pedro A. Diaz-Gomez, Dean F. Hougen: The snake in the box problem: mathematical conjecture and a genetic algorithm approach. 1409-1410
• 
  Mitsuo Gen, Lin Lin: A new approach for shortest path routing problem by random key-based GA. 1411-1412
• 
  Xiaojun Geng: Solving identification problem for asynchronous finite state machines using genetic algorithms. 1413-1414
• 
  Ping-Chu Hung, Ying-Ping Chen: iECGA: integer extended compact genetic algorithm. 1415-1416
• 
  Xavier Llorà, Kumara Sastry, Francesc Alías, David E. Goldberg, Michael Welge: Analyzing active interactive genetic algorithms using visual analytics. 1417-1418
• 
  Mitsukuni Matayoshi, Morikazu Nakamura, Hayao Miyagi: Extraction of landscape information based on a quality control approach and its applications to mutation in GAExtraction of landscape information based on a quality control approach and its applications to mutation in GA. 1419-1420
• 
  Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon, Riccardo Poli: Generalized cycle crossover for graph partitioning. 1421-1422
• 
  M. Kivanc Oner, Ivan I. Garibay, Annie S. Wu: Mating networks in steady state genetic algorithms are scale free. 1423-1424
• 
  Qinru Qiu, Qing Wu, Daniel J. Burns, Douglas Holzhauer: Distributed genetic algorithm for energy-efficient resource management in sensor networks. 1425-1426
• 
  Luke Sheneman, James A. Foster: Estimating the destructiveness of crossover on binary tree representations. 1427-1428
• 
  Paul Snijders, Edwin D. de Jong, Bart de Boer, Franjo Weissing: Multi-objective diversity maintenance. 1429-1430
• 
  Otávio Noura Teixeira, Artur Noura Teixeira, Felipe Houat de Brito, Roberto Célio Limão de Oliveira: Game theory as a new paradigm for phenotype characterization of genetic algorithms. 1431-1432
• 
  Hoa Vo, Justin Terada, David Joslin, Jeff Dragovich: Leveraging domain-expert knowledge in a genetic algorithm for civil engineering design optimization. 1433-1434
• 
  Shengxiang Yang: Dominance learning in diploid genetic algorithms for dynamic optimization problems. 1435-1436
• 
  Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hugo de Garis, Lishan Kang, Lixin X. Ding: Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design. 1437-1438

Artificial life, evolutionary robotics, adaptive behavior: posters

• 
  Arturo Chavoya, Yves Duthen: Using a genetic algorithm to evolve cellular automata for 2D/3D computational development. 231-232
• 
  David J. Montana, Eric Van Wyk, Marshall Brinn, Joshua Montana, Stephen Milligan: Genomic computing networks learn complex POMDPs. 233-234
• 
  H. L. Peng, J. C. Tay: The Baldwin effect under spatial isolation and autonomous reproduction. 235-236

Biological applications: papers

• 
  Arpit A. Almal, Anirban P. Mitra, Ram H. Datar, Peter F. Lenehan, David W. Fry, Richard J. Cote, William P. Worzel: Using genetic programming to classify node positive patients in bladder cancer. 239-246
• 
  Jaume Bacardit, Michael Stout, Natalio Krasnogor, Jonathan D. Hirst, Jacek Blazewicz: Coordination number prediction using learning classifier systems: performance and interpretability. 247-254
• 
  Francesco Archetti, Stefano Lanzeni, Enza Messina, Leonardo Vanneschi: Genetic programming for human oral bioavailability of drugs. 255-262
• 
  Nasimul Noman, Hitoshi Iba: Inference of genetic networks using S-system: information criteria for model selection. 263-270
• 
  Topon Kumar Paul, Hitoshi Iba: Identification of weak motifs in multiple biological sequences using genetic algorithm. 271-278
• 
  Christian Spieth, Nadine Hassis, Felix Streichert: Comparing mathematical models on the problem of network inference. 279-286
• 
  Tiffani L. Williams, Marc L. Smith: The role of diverse populations in phylogenetic analysis. 287-294

Biological applications: posters

• 
  Ignasi Belda, Ivan Traus, Susana Gordo, Teresa Tarragó, Sergio Madurga, Xavier Llorà, Ernest Giralt: Peptide data mining: from virtual design to knowledge extraction. 297-298
• 
  Clayton Matthew Johnson, Anitha Katikireddy: A genetic algorithm with backtracking for protein structure prediction. 299-300
• 
  Timothy Meekhof, Gary W. Daughdrill, Robert B. Heckendorn: String transformation-based Bayesian classification or proteins. 301-302
• 
  Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon: A hybrid genetic search for multiple sequence alignment. 303-304
• 
  Christian Spieth, Rene Worzischek, Felix Streichert: Comparing evolutionary algorithms on the problem of network inference. 305-306
• 
  Philip Tan, Joc Cing Tay: Evolving boolean networks to find intervention points in dengue pathogenesis. 307-308
• 
  Frederik P. J. Vandecasteele, Thomas F. Hess, Ronald L. Crawford: Genetic algorithms are suitable for driving microbial ecosystems in desirable directions. 309-310

Coevolution: papers

• 
  Edwin D. de Jong, Anthony Bucci: DECA: dimension extracting coevolutionary algorithm. 313-320
• 
  Sevan G. Ficici: A game-theoretic investigation of selection methods in two-population coevolution. 321-328
• 
  German A. Monroy, Kenneth O. Stanley, Risto Miikkulainen: Coevolution of neural networks using a layered pareto archive. 329-336
• 
  Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlassis: The parallel Nash Memory for asymmetric games. 337-344
• 
  Liviu Panait, Sean Luke, Joseph F. Harrison: Archive-based cooperative coevolutionary algorithms. 345-352
• 
  Elena Popovici, Kenneth A. De Jong: The effects of interaction frequency on the optimization performance of cooperative coevolution. 353-360
• 
  Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsecchi, Stefano Cagnoni: Heterogeneous cooperative coevolution: strategies of integration between GP and GA. 361-368
• 
  R. Paul Wiegand, Mitchell A. Potter: Robustness in cooperative coevolution. 369-376

Coevolution: posters

• 
  Bastian Baranski, Thomas Bartz-Beielstein, Rüdiger Ehlers, Thusinthan Kajendran, Björn Kosslers, Jörn Mehnen, Tomasz Polaszek, Ralf Reimholz, Jens M. Schmidt, Karlheinz Schmitt, Danny Seis, Rafael Slodzinski, Simon Steeg, Nils Wiemann, Marc Zimmermann: High-order punishment and the evolution of cooperation. 379-380
• 
  Walter de Back, Marco Wiering, Edwin D. de Jong: Red Queen dynamics in a predator-prey ecosystem. 381-382
• 
  Nanlin Jin: Indirect co-evolution for understanding belief in an incomplete information dynamic game. 383-384
• 
  Michael D. Schmidt, Hod Lipson: Actively probing and modeling users in interactive coevolution. 385-386

Estimation of distribution algorithms: papers

• 
  Yunpeng Cai, Xiaomin Sun, Peifa Jia: Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence. 389-396
• 
  Jörn Grahl, Peter A. N. Bosman, Franz Rothlauf: The correlation-triggered adaptive variance scaling IDEA. 397-404
• 
  Martin Pelikan, Kumara Sastry, David E. Goldberg: Sporadic model building for efficiency enhancement of hierarchical BOA. 405-412
• 
  Andrei Petrovski, Siddhartha Shakya, John A. W. McCall: Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms. 413-418
• 
  Kumara Sastry, Cláudio F. Lima, David E. Goldberg: Evaluation relaxation using substructural information and linear estimation. 419-426

Estimation of distribution algorithms: posters

• 
  Moshe Looks: Levels of abstraction in modeling and sampling: the feature-based Bayesian optimization algorithm. 429-430
• 
  Martin Pelikan, Kumara Sastry, Martin V. Butz, David E. Goldberg: Hierarchical BOA on random decomposable problems. 431-432
• 
  Hao Wu, Jonathan L. Shapiro: Does overfitting affect performance in estimation of distribution algorithms. 433-434

Evolution strategies, evolutionary programming: papers

• 
  Dirk V. Arnold, Alexander MacLeod: Hierarchically organised evolution strategies on the parabolic ridge. 437-444
• 
  Anne Auger, Nikolaus Hansen: Reconsidering the progress rate theory for evolution strategies in finite dimensions. 445-452
• 
  Christian Igel, Thorsten Suttorp, Nikolaus Hansen: A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies. 453-460
• 
  Jens Jägersküpper: Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations. 461-468
• 
  Thomas Jansen, Ingo Wegener: On the local performance of simulated annealing and the (1+1) evolutionary algorithm. 469-476
• 
  Monte Lunacek, Darrell Whitley: The dispersion metric and the CMA evolution strategy. 477-484
• 
  Efrén Mezura-Montes, Jesús Velázquez-Reyes, Carlos A. Coello Coello: A comparative study of differential evolution variants for global optimization. 485-492
• 
  Dirk Sudholt: On the analysis of the (1+1) memetic algorithm. 493-500

Evolution strategies, evolutionary programming: poster

• 
  Andrea Soltoggio: A simple line search operator for ridged landscapes. 503-504

Evolutionary combinatorial optimization: papers

• 
  William Beaudoin, Sébastien Vérel, Philippe Collard, Cathy Escazut: Deceptiveness and neutrality the ND family of fitness landscapes. 507-514
• 
  Christian Blum: A new hybrid evolutionary algorithm for the huge k-cardinality tree problem. 515-522
• 
  Yoginder S. Dandass, Amit C. Bugde: Comparison of genetic representation schemes for scheduling soft real-time parallel applications. 523-530
• 
  Manuel Cebrián, Iván Dotú: GRASP - evolution for constraint satisfaction problems. 531-538
• 
  Oliver Giel, Ingo Wegener: Maximum cardinality matchings on trees by randomized local search. 539-546
• 
  Amanda Hiley, Bryant A. Julstrom: The quadratic multiple knapsack problem and three heuristic approaches to it. 547-552
• 
  Jeremiah Nummela, Bryant A. Julstrom: An effective genetic algorithm for the minimum-label spanning tree problem. 553-558
• 
  David Simoncini, Sébastien Vérel, Philippe Collard, Manuel Clergue: Anisotropic selection in cellular genetic algorithms. 559-566
• 
  Tobias Storch: How randomized search heuristics find maximum cliques in planar graphs. 567-574
• 
  Jing Tang, Meng-Hiot Lim, Yew-Soon Ong: Adaptation for parallel memetic algorithm based on population entropy. 575-582
• 
  Syhlin Kuah, Joc Cing Tay: Combining simplex with niche-based evolutionary computation for job-shop scheduling. 583-590
• 
  Hugo Terashima-Marín, Cláudia J. Farías Zárate, Peter Ross, Manuel Valenzuela-Rendón: A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem. 591-598
• 
  Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang: A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem. 599-606

Evolutionary combinatorial optimization: posters

• 
  Brenda Hinkemeyer, Bryant A. Julstrom: A genetic algorithm for the longest common subsequence problem. 609-610
• 
  Steven Manos, Geraint Lewis: A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory. 611-612
• 
  Sébastien Vérel, Philippe Collard, Manuel Clergue: Measuring the evolvability landscape to study neutrality. 613-614
• 
  Mohammed S. Zahrani, Martin J. Loomes, James A. Malcolm, Andreas Alexander Albrecht: Genetic local search for multicast routing. 615-616

Evolutionary multiobjective optimization: papers

• 
  Adam Berry, Peter Vamplew: An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm. 619-626
• 
  Peter A. N. Bosman, Edwin D. de Jong: Combining gradient techniques for numerical multi-objective evolutionary optimization. 627-634
• 
  Kalyanmoy Deb, J. Sundar: Reference point based multi-objective optimization using evolutionary algorithms. 635-642
• 
  Kalyanmoy Deb, Shamik Chaudhuri, Kaisa Miettinen: Towards estimating nadir objective vector using evolutionary approaches. 643-650
• 
  Oliver Giel, Per Kristian Lehre: On the effect of populations in evolutionary multi-objective optimization. 651-658
• 
  Ken Harada, Jun Sakuma, Shigenobu Kobayashi: Local search for multiobjective function optimization: pareto descent method. 659-666
• 
  Ken Harada, Kokolo Ikeda, Shigenobu Kobayashi: Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS. 667-674
• 
  Alfredo García Hernández-Díaz, Luis V. Santana-Quintero, Carlos A. Coello Coello, Rafael Caballero, Julián Molina Luque: A new proposal for multi-objective optimization using differential evolution and rough sets theory. 675-682
• 
  Antony W. Iorio, Xiaodong Li: Rotated test problems for assessing the performance of multi-objective optimization algorithms. 683-690
• 
  Antony W. Iorio, Xiaodong Li: Incorporating directional information within a differential evolution algorithm for multi-objective optimization. 691-698
• 
  Michael Lawrence: Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses. 699-706
• 
  Christian Grimme, Karlheinz Schmitt: Inside a predator-prey model for multi-objective optimization: a second study. 707-714
• 
  Dipti Srinivasan, Lily Rachmawati: An efficient multi-objective evolutionary algorithm with steady-state replacement model. 715-722
• 
  Julio J. Valdés, Alan J. Barton: Multiobjective evolutionary optimization for visual data mining with virtual reality spaces: application to Alzheimer gene expressions. 723-730
• 
  Ying Zhang, Raffi R. Kamalian, Alice M. Agogino, Carlo H. Séquin: Design synthesis of microelectromechanical systems using genetic algorithms with component-based genotype representation. 731-738

Evolutionary multiobjective optimization: posters

• 
  Hisao Ishibuchi, Yusuke Nojima, Kaname Narukawa, Tsutomu Doi: Incorporation of decision maker's preference into evolutionary multiobjective optimization algorithms. 741-742
• 
  Mark P. Kleeman, Gary B. Lamont: The multi-objective constrained assignment problem. 743-744
• 
  Kangshun Li, Xuezhi Yue, Lishan Kang, Zhangxin Chen: A new multi-objective evolutionary algorithm for solving high complex multi-objective problems. 745-746
• 
  Ingo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese: Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. 747-748
• 
  Lily Rachmawati, Dipti Srinivasan: A multi-objective evolutionary algorithm with weighted-sum niching for convergence on knee regions. 749-750

Evolvable hardware: papers

• 
  Varun Aggarwal, Wesley O. Jin, Una-May O'Reilly: Filter approximation using explicit time and frequency domain specifications. 753-760
• 
  Geoffrey A. Hollinger, David A. Gwaltney: Evolutionary design of fault-tolerant analog control for a piezoelectric pipe-crawling robot. 761-768
• 
  Pierre-André Mudry, Guillaume Zufferey, Gianluca Tempesti: A dynamically constrained genetic algorithm for hardware-software partitioning. 769-776

Evolvable hardware: poster

• 
  Sami J. Habib, Alice C. Parker: Exploring network topology evolution through evolutionary computations. 779-780

Genetic programming: papers

• 
  Clément Chion, Luis E. Da Costa, Jacques-André Landry: Genetic programming for agricultural purposes. 783-790
• 
  Gianluigi Folino, Clara Pizzuti, Giandomenico Spezzano: Improving cooperative GP ensemble with clustering and pruning for pattern classification. 791-798
• 
  Jason M. Daida: Characterizing the dynamics of symmetry breaking in genetic programming. 799-806
• 
  Tuan Hao Hoang, Nguyen Xuan Hoai, Nguyen Thi Hien, Robert I. McKay, Daryl Essam: ORDERTREE: a new test problem for genetic programming. 807-814
• 
  Gregory Hornby: ALPS: the age-layered population structure for reducing the problem of premature convergence. 815-822
• 
  Lee W. Jones, Sameer H. Al-Sakran, John R. Koza: Automated synthesis of a human-competitive solution to the challenge problem of the 2002 international optical design conference by means of genetic programming and a multi-dimensional mutation operation. 823-830
• 
  Nicolas Lassabe, Stéphane Sanchez, Hervé Luga, Yves Duthen: Genetically programmed strategies for chess endgame. 831-838
• 
  Wai Shing Lau, Kin-Hong Lee, Kwong-Sak Leung: A hybridized genetic parallel programming based logic circuit synthesizer. 839-846
• 
  Hammad Majeed, Conor Ryan: Using context-aware crossover to improve the performance of GP. 847-854
• 
  Trent McConaghy, Georges G. E. Gielen: Canonical form functions as a simple means for genetic programming to evolve human-interpretable functions. 855-862
• 
  Andrew R. McIntyre, Malcolm I. Heywood: MOGE: GP classification problem decomposition using multi-objective optimization. 863-870
• 
  Alan Piszcz, Terence Soule: Dynamics of evolutionary robustness. 871-878
• 
  Lothar M. Schmitt, Stefan Droste: Convergence to global optima for genetic programming systems with dynamically scaled operators. 879-886
• 
  Leonardo Trujillo, Gustavo Olague: Synthesis of interest point detectors through genetic programming. 887-894
• 
  Leonardo Vanneschi, Yuri Pirola, Philippe Collard: A quantitative study of neutrality in GP boolean landscapes. 895-902
• 
  James Alfred Walker, Julian Francis Miller, Rachel Cavill: A multi-chromosome approach to standard and embedded cartesian genetic programming. 903-910
• 
  James Alfred Walker, Julian Francis Miller: Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems. 911-918
• 
  L. Darrell Whitley, Marc D. Richards, J. Ross Beveridge, André da Motta Salles Barreto: Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP. 919-926
• 
  Phillip Wong, Mengjie Zhang: Algebraic simplification of GP programs during evolution. 927-934

Genetic programming: posters

• 
  Luis E. Da Costa, Jacques-André Landry: Relaxed genetic programming. 937-938
• 
  Ashley George, Malcolm I. Heywood: Improving GP classifier generalization using a cluster separation metric. 939-940
• 
  Stefan Kahrs: Genetic programming with primitive recursion. 941-942
• 
  Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon: Nonlinear parametric regression in genetic programming. 943-944
• 
  Michal Lemczyk, Malcolm I. Heywood: Pareto-coevolutionary genetic programming classifier. 945-946
• 
  Alison A. Motsinger, Lance W. Hahn, Scott M. Dudek, Kelli K. Ryckman, Marylyn D. Ritchie: Alternative cross-over strategies and selection techniques for grammatical evolution optimized neural networks. 947-948
• 
  Zuzana Oplatková, Ivan Zelinka: Investigation on artificial ant using analytic programming. 949-950
• 
  Alan Piszcz, Terence Soule: A survey of mutation techniques in genetic programming. 951-952
• 
  Alan Piszcz, Terence Soule: Genetic programming: optimal population sizes for varying complexity problems. 953-954
• 
  Roy Schwaerzel, Tom Bylander: Predicting currency exchange rates by genetic programming with trigonometric functions and high-order statistics. 955-956
• 
  Børge Svingen: When lisp is faster than C. 957-958
• 
  Russell Thomason, Terence Soule: Redundant genes and the evolution of robustness. 959-960

Genetic algorithms: papers

• 
  Adrian K. Agogino, Kagan Tumer: Distributed evaluation functions for fault tolerant multi-rover systems. 1079-1086
• 
  Yossi Borenstein, Riccardo Poli: Structure and metaheuristics. 1087-1094
• 
  Keki M. Burjorjee, Jordan B. Pollack: A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations. 1095-1102
• 
  Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen: Adaptive discretization for probabilistic model building genetic algorithms. 1103-1110
• 
  David M. Cherba, William F. Punch: Crossover gene selection by spatial location. 1111-1116
• 
  Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon: Properties of symmetric fitness functions. 1117-1124
• 
  Vincent A. Cicirello: Non-wrapping order crossover: an order preserving crossover operator that respects absolute position. 1125-1132
• 
  David Jonathan Coffin, Christopher D. Clack: gLINC: identifying composability using group perturbation. 1133-1140
• 
  Kalyanmoy Deb, Ankur Sinha, Saku Kukkonen: Multi-objective test problems, linkages, and evolutionary methodologies. 1141-1148
• 
  Edgar Galván López, Riccardo Poli: An empirical investigation of how and why neutrality affects evolutionary search. 1149-1156
• 
  Jie Gao, Mitsuo Gen, Linyan Sun: A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problemA hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem. 1157-1164
• 
  Lena Mariann Garder, Mats Erling Høvin: Robot gaits evolved by combining genetic algorithms and binary hill climbing. 1165-1170
• 
  Payel Ghosh, Melanie Mitchell: Segmentation of medical images using a genetic algorithm. 1171-1178
• 
  William A. Greene: A tree-based genetic algorithm for building rectilinear Steiner arborescences. 1179-1186
• 
  Martin Gruber, Jano I. van Hemert, Günther R. Raidl: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. 1187-1194
• 
  Hisashi Handa: Fitness function for finding out robust solutions on time-varying functions. 1195-1200
• 
  Iason Hatzakis, David Wallace: Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. 1201-1208
• 
  Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon: Multi-attractor gene reordering for graph bisection. 1209-1216
• 
  Yong-Hyuk Kim, Yourim Yoon, Alberto Moraglio, Byung Ro Moon: Geometric crossover for multiway graph partitioning. 1217-1224
• 
  Yong Liang, Kwong-Sak Leung, Kin-Hong Lee: A splicing/decomposable encoding and its novel operators for genetic algorithms. 1225-1232
• 
  Fernando G. Lobo, Cláudio F. Lima: On the utility of the multimodal problem generator for assessing the performance of evolutionary algorithms. 1233-1240
• 
  Fernando G. Lobo, Cláudio F. Lima: Revisiting evolutionary algorithms with on-the-fly population size adjustment. 1241-1248
• 
  Jacob G. Martin: Spectral techniques for graph bisection in genetic algorithms. 1249-1256
• 
  Alfonsas Misevicius: A fast hybrid genetic algorithm for the quadratic assignment problem. 1257-1264
• 
  Nasimul Noman, Hitoshi Iba: A new generation alternation model for differential evolution. 1265-1272
• 
  Christophe Philemotte, Hugues Bersini: How an optimal observer can collapse the search space. 1273-1280
• 
  Janusz Wojtusiak, Ryszard S. Michalski: The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems. 1281-1288
• 
  William Rand, Rick L. Riolo, John H. Holland: The effect of crossover on the behavior of the GA in dynamic environments: a case study using the shaky ladder hyperplane-defined functions. 1289-1296
• 
  Joseph Reisinger, Risto Miikkulainen: Selecting for evolvable representations. 1297-1304
• 
  Gulshan Singh, Kalyanmoy Deb: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. 1305-1312
• 
  Jorge Cervantes, Christopher R. Stephens: "Optimal" mutation rates for genetic search. 1313-1320
• 
  Matthew E. Taylor, Shimon Whiteson, Peter Stone: Comparing evolutionary and temporal difference methods in a reinforcement learning domain. 1321-1328
• 
  Justin Terada, Hoa Vo, David Joslin: Combining genetic algorithms with squeaky-wheel optimization. 1329-1336
• 
  Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama: A crossover for complex building blocks overlapping. 1337-1344
• 
  James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker: Use of statistical outlier detection method in adaptive evolutionary algorithms. 1345-1352
• 
  James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker: Credit assignment in adaptive evolutionary algorithms. 1353-1360
• 
  Paul Winward, David E. Goldberg: Fluctuating crosstalk, deterministic noise, and GA scalability. 1361-1368
• 
  Alden H. Wright, J. Neal Richter: Strong recombination, weak selection, and mutation. 1369-1376
• 
  Shengxiang Yang: A comparative study of immune system based genetic algorithms in dynamic environments. 1377-1384
• 
  Tian-Li Yu, David E. Goldberg: Conquering hierarchical difficulty by explicit chunking: substructural chromosome compression. 1385-1392

Learning Classifier systems and other genetics-based machine learning: papers

• 
  Jaume Bacardit, Natalio Krasnogor: Smart crossover operator with multiple parents for a Pittsburgh learning classifier system. 1441-1448
• 
  Martin V. Butz, Martin Pelikan: Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions. 1449-1456
• 
  Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson: Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure. 1457-1464
• 
  Julia Handl, Joshua D. Knowles: On semi-supervised clustering via multiobjective optimization. 1465-1472
• 
  Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souza Britto Jr.: Evolving ensemble of classifiers in random subspace. 1473-1480
• 
  Pier Luca Lanzi, Stewart W. Wilson: Using convex hulls to represent classifier conditions. 1481-1488
• 
  Pier Luca Lanzi, Daniele Loiacono: Standard and averaging reinforcement learning in XCS. 1489-1496
• 
  Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, David E. Goldberg: Classifier prediction based on tile coding. 1497-1504
• 
  Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, David E. Goldberg: Prediction update algorithms for XCSF: RLS, Kalman filter, and gain adaptation. 1505-1512
• 
  Xavier Llorà, Kumara Sastry: Fast rule matching for learning classifier systems via vector instructions. 1513-1520
• 
  Javier G. Marín-Blázquez, Sonia Schulenburg: Multi-step environment learning classifier systems applied to hyper-heuristics. 1521-1528
• 
  James A. R. Marshall, Tim Kovacs: A representational ecology for learning classifier systems. 1529-1536
• 
  Davide Aliprandi, Alex Mancastroppa, Matteo Matteucci: A Bayesian approach to learning classifier systems in uncertain environments. 1537-1544
• 
  Ingo Mierswa, Michael Wurst: Information preserving multi-objective feature selection for unsupervised learning. 1545-1552
• 
  Ingo Mierswa: Evolutionary learning with kernels: a generic solution for large margin problems. 1553-1560
• 
  Albert Orriols-Puig, Ester Bernadó-Mansilla: Bounding XCS's parameters for unbalanced datasets. 1561-1568
• 
  Jeff Riley, Victor Ciesielski: Analysis of the difficulty of learning goal-scoring behaviour for robot soccer. 1569-1576
• 
  Shimon Whiteson, Peter Stone: On-line evolutionary computation for reinforcement learning in stochastic domains. 1577-1584

Learning Classifier systems and other genetics-based machine learning: posters

• 
  Stuart W. Card, Chilukuri K. Mohan: Ensemble selection for evolutionary learning using information theory and price's theorem. 1587-1588
• 
  Hong-Wei Chen, Ying-Ping Chen: FTXI: fault tolerance XCS in integer. 1589-1590
• 
  Hisao Ishibuchi, Yusuke Nojima, Isao Kuwajima: Multiobjective genetic rule selection as a data mining postprocessing procedure. 1591-1592
• 
  Nick Miles, Alex Alves Freitas, Stephen Serjeant: Estimating photometric redshifts with genetic algorithms. 1593-1594
• 
  Amin Nikanjam, Adel Torkaman Rahmani: An anticipatory approach to improve XCSF. 1595-1596
• 
  WonKyung Park, Jae C. Oh, Misty K. Blowers, Matt B. Wolf: An open-set speaker identification system using genetic learning classifier system. 1597-1598
• 
  Dipti Srinivasan, Dakun Woo, Lily Rachmawati, Kong Wei Lye: Evolving cooperative behavior in a power market. 1599-1600
• 
  Stephan M. Winkler, Michael Affenzeller, Stefan Wagner: Sets of receiver operating characteristic curves and their use in the evaluation of multi-class classification. 1601-1602

Real-world applications: papers

• 
  Antonia Azzini, Andrea Tettamanzi: A neural evolutionary approach to financial modeling. 1605-1612
• 
  Flor A. Castillo, Arthur K. Kordon, Guido Smits, Ben Christenson, Dee Dickerson: Pareto front genetic programming parameter selection based on design of experiments and industrial data. 1613-1620
• 
  Dave Cliff: Evolutionary optimization of ZIP60: a controlled explosion in hyperspace. 1621-1628
• 
  Kalyanmoy Deb, Aravind Srinivasan: Innovization: innovating design principles through optimization. 1629-1636
• 
  Daniel Delahaye, Stephane Puechmorel: 3D airspace sectoring by evolutionary computation: real-world applications. 1637-1644
• 
  Rui Li, Michael Emmerich, Jeroen Eggermont, Ernst G. P. Bovenkamp: Mixed-integer optimization of coronary vessel image analysis using evolution strategies. 1645-1652
• 
  Anna Esparcia-Alcázar, Lidia Lluch-Revert, Ken Sharman, José Miguel Albarracín-Guillem, Marta E. Palmer-Gato: Towards an evolutionary tool for the allocation of supermarket shelf space. 1653-1660
• 
  Bogdan Filipic, Iztok Fister, Marjan Mernik: Evolutionary search for optimal combinations of markers in clothing manufacturing. 1661-1666
• 
  Hilmi Günes Kayacik, Malcolm I. Heywood, A. Nur Zincir-Heywood: On evolving buffer overflow attacks using genetic programming. 1667-1674
• 
  Yaser M. A. Khalifa, O. Salem, A. Shahin: Cutting stock waste reduction using genetic algorithms. 1675-1680
• 
  Nate Kohl, Kenneth O. Stanley, Risto Miikkulainen, Michael E. Samples, Rini Sherony: Evolving a real-world vehicle warning system. 1681-1688
• 
  Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhattacharya: Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs. 1689-1696
• 
  Greg Lee, Vadim Bulitko: Genetic algorithms for action set selection across domains: a demonstration. 1697-1704
• 
  Yong Liang, Kwong-Sak Leung, Tony Shu Kam Mok: Automating the drug scheduling with different toxicity clearance in cancer chemotherapy via evolutionary computation. 1705-1712
• 
  Monte Lunacek, Darrell Whitley, Indrakshi Ray: A crossover operator for the k- anonymity problem. 1713-1720
• 
  Steven Manos, Leon Poladian, Peter J. Bentley, Maryanne Large: A genetic algorithm with a variable-length genotype and embryogeny for microstructured optical fibre design. 1721-1728
• 
  Songsak Chusanapiputt, Dulyatat Nualhong, Sujate Jantarang, Sukumvit Phoomvuthisarn: Selective self-adaptive approach to ant system for solving unit commitment problem. 1729-1736
• 
  Gerulf K. M. Pedersen, Zhenyu Yang: Multi-objective PID-controller tuning for a magnetic levitation system using NSGA-II. 1737-1744
• 
  Kumara Sastry, D. D. Johnson, Alexis L. Thompson, David E. Goldberg, Todd J. Martinez, Jeff Leiding, Jane Owens: Multiobjective genetic algorithms for multiscaling excited state direct dynamics in photochemistry. 1745-1752
• 
  Yuji Sato, Yosuke Akatsuka, Takenori Nishizono: Reward allotment in an event-driven hybrid learning classifier system for online soccer games. 1753-1760
• 
  Yann Semet, Marc Schoenauer: On the benefits of inoculation, an example in train scheduling. 1761-1768
• 
  Ofer M. Shir, Christian Siedschlag, Thomas Bäck, Marc J. J. Vrakking: The complete-basis-functions parameterization in ES and its application to laser pulse shaping. 1769-1776
• 
  Harish Subramanian, Subramanian Ramamoorthy, Peter Stone, Benjamin Kuipers: Designing safe, profitable automated stock trading agents using evolutionary algorithms. 1777-1784
• 
  Ivan Tanev, Michal Joachimczak, Katsunori Shimohara: Evolution of driving agent, remotely operating a scale model of a car with obstacle avoidance capabilities. 1785-1792
• 
  A. Oduguwa, A. Tiwari, S. Fiorentino, R. Roy: Multi-objective optimisation of the protein-ligand docking problem in drug discovery. 1793-1800
• 
  Haluk Topcuoglu, Murat Ermis: Genetic algorithms for positioning and utilizing sensors in synthetically generated landscapes. 1801-1808
• 
  Klaus Weinert, Andreas Zabel, Heinrich Müller, Petra Kersting: Optimizing of NC tool paths for five-axis milling using evolutionary algorithms on wavelets. 1809-1816
• 
  Wei Yan, Christopher D. Clack: Behavioural GP diversity for dynamic environments: an application in hedge fund investment. 1817-1824
• 
  Toshihiko Yanase, Hitoshi Iba: Evolutionary motion design for humanoid robots. 1825-1832
• 
  Qijun Zhang, Eduardo Reck Miranda: Evolving musical performance profiles using genetic algorithms with structural fitness. 1833-1840
• 
  Haipeng Zhang, Mitsuo Gen: Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system. 1841-1848

Real-world applications: poster

• 
  Peter Belford: Candlestick stock analysis with genetic algorithms. 1851-1852
• 
  Thomas Butter, Franz Rothlauf, Jörn Grahl, Tobias Hildenbrand, Jens Arndt: Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity. 1853-1854
• 
  Hao Chen, John A. Clark, Jeremy Jacob: Human competitive security protocols synthesis. 1855-1856
• 
  David de la Fuente, Alejandro Garrido, Jaime Laviada, Alberto Gomez: Genetic algorithms to optimise the time to make stock market investment. 1857-1858
• 
  David Delgado, David Vidal, German Hernandez: Evolutionary design of pseudorandom sequence generators based on cellular automata and its applicability in current cryptosystems. 1859-1860
• 
  César Estébanez, Julio César Hernández Castro, Arturo Ribagorda, Pedro Isasi: Evolving hash functions by means of genetic programming. 1861-1862
• 
  Tao-yang Fu, Tsu-yu Wu, Chin-te Chen, Kai-chu Wu, Ying-Ping Chen: Evolutionary interactive music composition. 1863-1864
• 
  Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio: Hybrid search for cardinality constrained portfolio optimization. 1865-1866
• 
  Alberto Gomez, David de la Fuente, Javier Puente, José Parreño: A case-study about shift work management at a hospital emergency department with genetic algorithms. 1867-1868
• 
  Satoshi Ikehira, Hajime Kimura: Multi-objective genetic algorithms for pipe arrangement design. 1869-1870
• 
  Clayton Matthew Johnson, Anu Bhat, William C. Thibault: An evolutionary approach to camera-based projector calibration. 1871-1872
• 
  Yaser M. A. Khalifa, Mohamed Basel Al-Mourad: Autonomous evolutionary music composer. 1873-1874
• 
  Yiming Li, Cheng-Kai Chen, Yen-Yu Cho: A unified optimization framework for microelectronics industry. 1875-1876
• 
  Robert M. Patton, Thomas E. Potok: Characterizing large text corpora using a maximum variation sampling genetic algorithm. 1877-1878
• 
  Neil Urquhart: Real-time construction of aircraft landing schedules using an evolutionary algorithm. 1879-1880
• 
  Joseph Vannucci, Deon Garrett, Dipankar Dasgupta: Comparative analysis of the sailor assignment problem. 1881-1882

Search-based software engineering: papers

• 
  Salah Bouktif, Giuliano Antoniol, Ettore Merlo, Markus Neteler: A novel approach to optimize clone refactoring activity. 1885-1892
• 
  Salah Bouktif, Houari A. Sahraoui, Giuliano Antoniol: Simulated annealing for improving software quality prediction. 1893-1900
• 
  Myra B. Cohen, Shiu Beng Kooi, Witawas Srisa-an: Clustering the heap in multi-threaded applications for improved garbage collection. 1901-1908
• 
  Olaf Seng, Johannes Stammel, David Burkhart: Search-based determination of refactorings for improving the class structure of object-oriented systems. 1909-1916
• 
  Marouane Tlili, Stefan Wappler, Harmen Sthamer: Improving evolutionary real-time testing. 1917-1924
• 
  Stefan Wappler, Joachim Wegener: Evolutionary unit testing of object-oriented software using strongly-typed genetic programming. 1925-1932
• 
  Jitian Xiao, Chiou Peng Lam, Huaizhong Li, Jun Wang: Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem. 1933-1940
• 
  Yuan Zhan, John A. Clark: The state problem for test generation in Simulink. 1941-1948

Search-based software engineering: posters

• 
  Mark Harman, Alexandros Skaliotis, Kathleen Steinhöfel, Paul Baker: Search--based approaches to the component selection and prioritization problem. 1951-1952
• 
  Yoonsik Cheon, Myoung Kim: A specification-based fitness function for evolutionary testing of object-oriented programs. 1953-1954
• 
  Johannes Mayer: Towards effective adaptive random testing for higher-dimensional input domains. 1955-1956
• 
  Christopher L. Simons, Ian C. Parmee: Single and multi-objective genetic operators in object-oriented conceptual software design. 1957-1958
• 
  H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harmanci: Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing. 1959-1960
• 
  Joseph Lewis, Chris Ansoff: Tuning experiments with an adaptive computational framework. 1961-1962