default search action
GECCO 2019: Prague, Czech Republic
- Anne Auger, Thomas Stützle:
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019. ACM 2019, ISBN 978-1-4503-6111-8
Keynote talk
- Ingo Rechenberg:
Evolution, robotics and the somersaulting spider. 1 - Robert Babuska:
Genetic programming methods for reinforcement learning. 2 - Raia Hadsell:
Challenges for learning in complex environments. 3
Ant colony optimization and swarm intelligence
- Umair Ayub, Asim Ikram, Waseem Shahzad:
AMclr: an improved ant-miner to extract comprehensible and diverse classification rules. 4-12 - Hassen Dhrif, Luis G. Sánchez Giraldo, Miroslav Kubat, Stefan Wuchty:
A stable hybrid method for feature subset selection using particle swarm optimization with local search. 13-21 - Kyle Erwin, Andries P. Engelbrecht:
Control parameter sensitivity analysis of the multi-guide particle swarm optimization algorithm. 22-29 - Florian Knauf, Ralf Bruns:
A peek into the swarm: analysis of the gravitational search algorithm and recommendations for parameter selection. 30-38 - Tien Thanh Nguyen, Anh Vu Luong, Thi Minh Van Nguyen, Trong Sy Ha, Alan Wee-Chung Liew, John McCall:
Simultaneous meta-data and meta-classifier selection in multiple classifier system. 39-46 - Joshua Peake, Martyn Amos, Paraskevas Yiapanis, Huw Lloyd:
Scaling techniques for parallel ant colony optimization on large problem instances. 47-54 - Ángel Arturo Rojas-García, Arturo Hernández Aguirre, S. Ivvan Valdez:
On the selection of the optimal topology for particle swarm optimization: a study of the tree as the universal topology. 55-62
Complex systems (artificial life/artificial immune systems/generative and developmental systems/evolutionary robotics/evolvable hardware)
- Amine M. Boumaza:
When mating improves on-line collective robotics. 63-71 - Jonathan C. Brant, Kenneth O. Stanley:
Benchmarking open-endedness in minimal criterion coevolution. 72-80 - Antoine Cully:
Autonomous skill discovery with quality-diversity and unsupervised descriptors. 81-89 - David Rushing Dewhurst, Michael Vincent Arnold, Colin Michael Van Oort:
Selection mechanisms affect volatility in evolving markets. 90-98 - Stéphane Doncieux, Alban Laflaquière, Alexandre Coninx:
Novelty search: a theoretical perspective. 99-106 - Alexander Gajewski, Jeff Clune, Kenneth O. Stanley, Joel Lehman:
Evolvability ES: scalable and direct optimization of evolvability. 107-115 - Alexander Hagg, Alexander Asteroth, Thomas Bäck:
Modeling user selection in quality diversity. 116-124 - Karine Miras, A. E. Eiben:
Effects of environmental conditions on evolved robot morphologies and behavior. 125-132 - Jørgen Nordmoen, Tønnes F. Nygaard, Kai Olav Ellefsen, Kyrre Glette:
Evolved embodied phase coordination enables robust quadruped robot locomotion. 133-141 - Rui Wang, Joel Lehman, Jeff Clune, Kenneth O. Stanley:
POET: open-ended coevolution of environments and their optimized solutions. 142-151 - Anil Yaman, Giovanni Iacca, Decebal Constantin Mocanu, George H. L. Fletcher, Mykola Pechenizkiy:
Learning with delayed synaptic plasticity. 152-160
Digital entertainment technologies and arts
- Matthew C. Fontaine, Scott Lee, Lisa B. Soros, Fernando de Mesentier Silva, Julian Togelius, Amy K. Hoover:
Mapping hearthstone deck spaces through MAP-elites with sliding boundaries. 161-169 - Simon M. Lucas, Vanessa Volz:
Tile pattern KL-divergence for analysing and evolving game levels. 170-178 - Robert J. Smith, Malcolm I. Heywood:
Evolving dota 2 shadow fiend bots using genetic programming with external memory. 179-187 - Csaba Sulyok, Christopher Harte, Zalán Bodó:
On the impact of domain-specific knowledge in evolutionary music composition. 188-197
Evolutionary combinatorial optimization and metaheuristics
- Mohamad Alissa, Kevin Sim, Emma Hart:
Algorithm selection using deep learning without feature extraction. 198-206 - Divansh Arora, Parikshit Maini, Pedro Pinacho Davidson, Christian Blum:
Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA. 207-214 - Dogan Corus, Pietro S. Oliveto, Donya Yazdani:
On inversely proportional hypermutations with mutation potential. 215-223 - Quang-Vinh Dang, Hana Rudová, Cong Thanh Nguyen:
Adaptive large neighborhood search for scheduling of mobile robots. 224-232 - Benjamin Doerr, Carola Doerr, Frank Neumann:
Fast re-optimization via structural diversity. 233-241 - Benjamin Doerr, Andrew M. Sutton:
When resampling to cope with noise, use median, not mean. 242-248 - Alex Gliesch, Marcus Ritt:
A generic approach to districting with diameter or center-based objectives. 249-257 - Mohammad Nazmul Haque, Luke Mathieson, Pablo Moscato:
A memetic algorithm approach to network alignment: mapping the classification of mental disorders of DSM-IV with ICD-10. 258-265 - Leticia Hernando, Alexander Mendiburu, José Antonio Lozano:
Characterising the rankings produced by combinatorial optimisation problems and finding their intersections. 266-273 - Naama Horesh, Thomas Bäck, Ofer M. Shir:
Predict or screen your expensive assay: DoE vs. surrogates in experimental combinatorial optimization. 274-284 - Domagoj Jakobovic, Stjepan Picek, Marcella S. R. Martins, Markus Wagner:
A characterisation of S-box fitness landscapes in cryptography. 285-293 - Angus Kenny, Xiaodong Li, Andreas T. Ernst, Yuan Sun:
An improved merge search algorithm for the constrained pit problem in open-pit mining. 294-302 - Florian Leprêtre, Sébastien Vérel, Cyril Fonlupt, Virginie Marion:
Walsh functions as surrogate model for pseudo-boolean optimization problems. 303-311 - Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev:
Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. 312-320 - Pedro Pinacho Davidson, Salim Bouamama, Christian Blum:
Application of CMSA to the minimum capacitated dominating set problem. 321-328 - Rogier Hans Wuijts, Dirk Thierens:
Investigation of the traveling thief problem. 329-337 - Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann:
Evolutionary algorithms for the chance-constrained knapsack problem. 338-346 - Fangfang Zhang, Yi Mei, Mengjie Zhang:
A two-stage genetic programming hyper-heuristic approach with feature selection for dynamic flexible job shop scheduling. 347-355
Evolutionary machine learning
- Sneha Aenugu, Lee Spector:
Lexicase selection in learning classifier systems. 356-364 - Ying Bi, Bing Xue, Mengjie Zhang:
An automated ensemble learning framework using genetic programming for image classification. 365-373 - Victor Costa, Nuno Lourenço, João Correia, Penousal Machado:
COEGAN: evaluating the coevolution effect in generative adversarial networks. 374-382 - Zheng Gao, Chun Guo, Xiaozhong Liu:
Efficient personalized community detection via genetic evolution. 383-391 - Celio H. N. Larcher Jr., Helio J. C. Barbosa:
Auto-CVE: a coevolutionary approach to evolve ensembles in automated machine learning. 392-400 - Jason Zhi Liang, Elliot Meyerson, Babak Hodjat, Daniel Fink, Karl Mutch, Risto Miikkulainen:
Evolutionary neural AutoML for deep learning. 401-409 - Yi Liu, Will N. Browne, Bing Xue:
Absumption to complement subsumption in learning classifier systems. 410-418 - Zhichao Lu, Ian Whalen, Vishnu Boddeti, Yashesh D. Dhebar, Kalyanmoy Deb, Erik D. Goodman, Wolfgang Banzhaf:
NSGA-Net: neural architecture search using multi-objective genetic algorithm. 419-427 - Trung B. Nguyen, Will N. Browne, Mengjie Zhang:
Improvement of code fragment fitness to guide feature construction in XCS. 428-436 - Bach Hoai Nguyen, Bing Xue, Mengjie Zhang, Peter Andreae:
Population-based ensemble classifier induction for domain adaptation. 437-445 - Alexander Ororbia, AbdElRahman ElSaid, Travis Desell:
Investigating recurrent neural network memory structures using neuro-evolution. 446-455 - Sebastian Risi, Kenneth O. Stanley:
Deep neuroevolution of recurrent and discrete world models. 456-462 - Cameron Shand, Richard Allmendinger, Julia Handl, Andrew M. Webb, John Keane:
Evolving controllably difficult datasets for clustering. 463-471 - Jamal Toutouh, Erik Hemberg, Una-May O'Reilly:
Spatial evolutionary generative adversarial networks. 472-480 - Binh Tran, Bing Xue, Mengjie Zhang:
Adaptive multi-subswarm optimisation for feature selection on high-dimensional classification. 481-489 - Bin Wang, Yanan Sun, Bing Xue, Mengjie Zhang:
Evolving deep neural networks by multi-objective particle swarm optimization for image classification. 490-498
Evolutionary multiobjective optimization
- Sunith Bandaru, Henrik Smedberg:
A parameterless performance metric for reference-point based multi-objective evolutionary algorithms. 499-506 - Nicolas Berveglieri, Bilel Derbel, Arnaud Liefooghe, Hernán E. Aguirre, Kiyoshi Tanaka:
Surrogate-assisted multiobjective optimization based on decomposition: a comprehensive comparative analysis. 507-515 - Jakob Bossek, Christian Grimme, Frank Neumann:
On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem. 516-523 - Jesús Guillermo Falcón-Cardona, Carlos A. Coello Coello:
Convergence and diversity analysis of indicator-based multi-objective evolutionary algorithms. 524-531 - Jonathan E. Fieldsend:
Efficient real-time hypervolume estimation with monotonically reducing error. 532-540 - Jonathan E. Fieldsend, Tinkle Chugh, Richard Allmendinger, Kaisa Miettinen:
A feature rich distance-based many-objective visualisable test problem generator. 541-549 - Gian Mauricio Fritsche, Aurora T. R. Pozo:
Cooperative based hyper-heuristic for many-objective optimization. 550-558 - Tobias Glasmachers:
Challenges of convex quadratic bi-objective benchmark problems. 559-567 - S. C. Maree, Tanja Alderliesten, Peter A. N. Bosman:
Real-valued evolutionary multi-modal multi-objective optimization by hill-valley clustering. 568-576 - Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Atif Hasan Rahman, Rifat Shahriyar, M. Sohel Rahman:
A 'phylogeny-aware' multi-objective optimization approach for computing MSA. 577-585 - Yusuke Nojima, Takafumi Fukase, Yiping Liu, Naoki Masuyama, Hisao Ishibuchi:
Constrained multiobjective distance minimization problems. 586-594 - Annibale Panichella:
An adaptive evolutionary algorithm based on non-euclidean geometry for many-objective optimization. 595-603 - Jeisson Prieto, Jonatan Gómez, Elizabeth León:
Multi-objective evolutionary algorithm for DNA codeword design. 604-611 - Ryoji Tanabe, Hisao Ishibuchi:
Non-elitist evolutionary multi-objective optimizers revisited. 612-619 - Leonardo C. T. Bezerra, Manuel López-Ibáñez, Thomas Stützle:
Archiver effects on the performance of state-of-the-art multi- and many-objective evolutionary algorithms. 620-628 - Michal K. Tomczyk, Milosz Kadzinski:
Robust indicator-based algorithm for interactive evolutionary multiple objective optimization. 629-637 - Cheikh Touré, Nikolaus Hansen, Anne Auger, Dimo Brockhoff:
Uncrowded hypervolume improvement: COMO-CMA-ES and the sofomore framework. 638-646 - Vanessa Volz, Boris Naujoks, Pascal Kerschke, Tea Tusar:
Single- and multi-objective game-benchmark for evolutionary algorithms. 647-655 - Kaifeng Yang, Pramudita Satria Palar, Michael Emmerich, Koji Shimoyama, Thomas Bäck:
A multi-point mechanism of expected hypervolume improvement for parallel multi-objective bayesian global optimization. 656-663
Evolutionary numerical optimization
- Nikolaus Hansen:
A global surrogate assisted CMA-ES. 664-672 - Michael Hellwig, Hans-Georg Beyer:
Analysis of a meta-ES on a conically constrained problem. 673-681 - Oswin Krause:
Large-scale noise-resilient evolution-strategies. 682-690 - Zbynek Pitra, Jakub Repický, Martin Holena:
Landscape analysis of gaussian process surrogates for the covariance matrix adaptation evolution strategy. 691-699 - Naoki Sakamoto, Youhei Akimoto:
Adaptive ranking based constraint handling for explicitly constrained black-box optimization. 700-708 - Mudita Sharma, Alexandros Komninos, Manuel López-Ibáñez, Dimitar Kazakov:
Deep reinforcement learning based parameter control in differential evolution. 709-717 - Tea Tusar, Dimo Brockhoff, Nikolaus Hansen:
Mixed-integer benchmark problems for single- and bi-objective optimization. 718-726 - Jingyun Yang, Dirk V. Arnold:
A surrogate model assisted (1+1)-ES with increased exploitation of the model. 727-735
Genetic algorithms
- Laila AlTerkawi, Matteo Migliavacca:
Parallelism and partitioning in large-scale GAs using spark. 736-744 - Simon Bowly:
A genetic algorithm hybridisation scheme for effective use of parallel workers. 745-752 - Arkadiy Dushatskiy, Adriënne M. Mendrik, Tanja Alderliesten, Peter A. N. Bosman:
Convolutional neural network surrogate-assisted GOMEA. 753-761 - Yohanes Bimo Dwianto, Hiroaki Fukumoto, Akira Oyama:
On improving the constraint-handling performance with modified multiple constraint ranking (MCR-mod) for engineering design optimization problems solved by evolutionary algorithms. 762-770 - Yong-Feng Ge, Jinli Cao, Hua Wang, Jiao Yin, Wei-jie Yu, Zhi-Hui Zhan, Jun Zhang:
A benefit-driven genetic algorithm for balancing privacy and utility in database fragmentation. 771-776 - René González Hernandez, Marley M. B. R. Vellasco, Karla Figueiredo:
Resource optimization for elective surgical procedures using quantum-inspired genetic algorithms. 777-786 - Mario Alejandro Hevia Fajardo:
An empirical evaluation of success-based parameter control mechanisms for evolutionary algorithms. 787-795 - Ahmed Khalifa, Michael Cerny Green, Gabriella A. B. Barros, Julian Togelius:
Intentional computational level design. 796-803 - Maciej Komosinski, Konrad Miazga:
Parametrizing convection selection: conclusions from the analysis of performance in the NKq model. 804-811 - Nam Le, Michael O'Neill, Anthony Brabazon:
Evolutionary consequences of learning strategies in a dynamic rugged landscape. 812-819 - Yi-Yun Liao, Hung-Wei Hsu, Yi-Lin Juang, Tian-Li Yu:
On the investigation of population sizing of genetic algorithms using optimal mixing. 820-828 - Thiago Macedo Gomes, Alan Robert Resende de Freitas, Rodolfo Ayala Lopes:
Multi-heap constraint handling in gray box evolutionary algorithms. 829-836 - Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann:
Evolutionary diversity optimization using multi-objective indicators. 837-845 - Gean Trindade Pereira, Paulo Henrique Ribeiro Gabriel, Ricardo Cerri:
A lexicographic genetic algorithm for hierarchical classification rule induction. 846-854 - Anna Rodionova, Kirill Antonov, Arina Buzdalova, Carola Doerr:
Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. 855-863 - Víctor M. Valenzuela, Carlos A. Brizuela, María Cosío León, Alma Danisa Romero Ocaño:
A combination of two simple decoding strategies for the no-wait job shop scheduling problem. 864-871 - Swetha Varadarajan, L. Darrell Whitley:
The massively parallel mixing genetic algorithm for the traveling salesman problem. 872-879
General evolutionary computation and hybrids
- Youhei Akimoto, Takuma Shimizu, Takahiro Yamaguchi:
Adaptive objective selection for multi-fidelity optimization. 880-888 - Nguyen Dang, Carola Doerr:
Hyper-parameter tuning for the (1 + (λ, λ)) GA. 889-897 - Thomas Gabor, Andreas Sedlmeier, Marie Kiermeier, Thomy Phan, Marcel Henrich, Monika Pichlmair, Bernhard Kempter, Cornel Klein, Horst Sauer, Reiner N. Schmid, Jan Wieghardt:
Scenario co-evolution for reinforcement learning on a grid world smart factory domain. 898-906 - George T. Hall, Pietro S. Oliveto, Dirk Sudholt:
On the impact of the cutoff time on the performance of algorithm configurators. 907-915 - Daniel Horn, Jörg Stork, Nils-Jannik Schüßler, Martin Zaefferer:
Surrogates for hierarchical search spaces: the wedge-kernel and an automated analysis. 916-924 - Lucas Marcondes Pavelski, Myriam Regattieri Delgado, Marie-Eléonore Kessaci:
Meta-learning on flowshop using fitness landscape analysis. 925-933 - Jörg Stork, Martin Zaefferer, Thomas Bartz-Beielstein, A. E. Eiben:
Surrogate models for enhancing the efficiency of neuroevolution in reinforcement learning. 934-942 - Hao Tong, Jialin Liu, Xin Yao:
Algorithm portfolio for individual-based surrogate-assisted evolutionary algorithms. 943-950 - Diederick Vermetten, Sander van Rijn, Thomas Bäck, Carola Doerr:
Online selection of CMA-ES variants. 951-959 - Ahmed Bin Zaman, Kenneth A. De Jong, Amarda Shehu:
Using subpopulation EAs to map molecular structure landscapes. 960-967
Genetic programming
- Timothy Atkinson, Detlef Plump, Susan Stepney:
Evolving graphs with horizontal gene transfer. 968-976 - Iwo Bladek, Krzysztof Krawiec:
Solving symbolic regression problems with formal constraints. 977-984 - Alexander E. I. Brownlee, Justyna Petke, Brad Alexander, Earl T. Barr, Markus Wagner, David Robert White:
Gin: genetic improvement research made easy. 985-993 - Vinícius Veloso de Melo, Danilo Vasconcellos Vargas, Wolfgang Banzhaf:
Batch tournament selection for genetic programming: the quality of lexicase, the speed of tournament. 994-1002 - Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto:
Evolving boolean functions with conjunctions and disjunctions via genetic programming. 1003-1011 - Benjamin P. Evans, Bing Xue, Mengjie Zhang:
What's inside the black-box?: a genetic programming method for interpreting complex machine learning models. 1012-1020 - Edgar Galván, Marc Schoenauer:
Promoting semantic diversity in multi-objective genetic programming. 1021-1029 - Thomas Helmuth, Edward R. Pantridge, Lee Spector:
Lexicase selection of specialists. 1030-1038 - Erik Hemberg, Jonathan Kelly, Una-May O'Reilly:
On domain knowledge and novelty to improve program synthesis performance with grammatical evolution. 1039-1046 - Lia Jundt, Thomas Helmuth:
Comparing and combining lexicase selection and novelty search. 1047-1055 - William G. La Cava, Jason H. Moore:
Semantic variation operators for multidimensional genetic programming. 1056-1064 - Dominik Sobania, Franz Rothlauf:
Teaching GP to program like a human software developer: using perplexity pressure to guide program synthesis approaches. 1065-1074 - Léo Françoso Dal Piccol Sotto, Franz Rothlauf:
On the role of non-effective code in linear genetic programming. 1075-1083 - Marco Virgolin, Tanja Alderliesten, Peter A. N. Bosman:
Linear scaling with and within semantic backpropagation-based genetic programming for symbolic regression. 1084-1092 - Shaolin Wang, Yi Mei, Mengjie Zhang:
Novel ensemble genetic programming hyper-heuristics for uncertain capacitated arc routing problem. 1093-1101
Real world applications
- Leena N. Ahmed, Philipp Heyken-Soares, Christine L. Mumford, Yong Mao:
Optimising bus routes with fixed terminal nodes: comparing hyper-heuristics with NSGAII on realistic transportation networks. 1102-1110 - Moustafa Alzantot, Yash Sharma, Supriyo Chakraborty, Huan Zhang, Cho-Jui Hsieh, Mani B. Srivastava:
GenAttack: practical black-box attacks with gradient-free optimization. 1111-1119 - Rui P. Cardoso, Emma Hart, Jeremy V. Pitt:
Evolving robust policies for community energy system management. 1120-1128 - Conrad Chan, Aldeida Aleti, Alexander Heger, Kate Smith-Miles:
Evolving stellar models to find the origins of our galaxy. 1129-1137 - Boonyarit Changaival, Grégoire Danoy, Dzmitry Kliazovich, Frédéric Guinand, Matthias R. Brust, Jedrzej Musial, Kittichai Lavangnananda, Pascal Bouvry:
Toward real-world vehicle placement optimization in round-trip carsharing. 1138-1146 - Tinkle Chugh, Tomas Kratky, Kaisa Miettinen, Yaochu Jin, Pekka Makkonen:
Multiobjective shape design in a ventilation system with a preference-driven surrogate-assisted evolutionary algorithm. 1147-1155 - Marcin Czajkowski, Marek Kretowski:
Relative evolutionary hierarchical analysis for gene expression data classification. 1156-1164 - Gabriel Henrique de Souza, Heder Soares Bernardino, Alex Borges Vieira, Helio J. C. Barbosa:
Differential evolution based spatial filter optimization for brain-computer interface. 1165-1173 - Diane P. Fraser, Edward C. Keedwell, Stephen L. Michell, Ray Sheridan:
EMOCS: evolutionary multi-objective optimisation for clinical scorecard generation. 1174-1182 - Markus Friedrich, Pierre-Alain Fayolle, Thomas Gabor, Claudia Linnhoff-Popien:
Optimizing evolutionary CSG tree extraction. 1183-1191 - Ekaterina A. Holdener, Flavio Esposito, Dmitrii Chemodanov:
EVA: an evolutionary architecture for network virtualization. 1192-1197 - Assaf Israeli, Michael Emmerich, Michael Iggy Litaor, Ofer M. Shir:
Statistical learning in soil sampling design aided by pareto optimization. 1198-1205 - Diogo M. F. Izidio, Antonyus P. do A. Ferreira, Edna Natividade da Silva Barros:
Towards better generalization in WLAN positioning systems with genetic algorithms and neural networks. 1206-1213 - Matthew Barrie Johns, Herman A. Mahmoud, David J. Walker, Nicholas D. F. Ross, Edward C. Keedwell, Dragan A. Savic:
Augmented evolutionary intelligence: combining human and evolutionary design for water distribution network optimisation. 1214-1222 - Benjamin D. M. Jones, David Robert White, George O. O'Brien, John A. Clark, Earl T. Campbell:
Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategies. 1223-1231 - Jane Jean Kiam, Eva Besada-Portas, Valerie Hehtke, Axel Schulte:
GA-guided task planning for multiple-HAPS in realistic time-varying operation environments. 1232-1240 - Nian-Ze Lee, Paolo Arcaini, Shaukat Ali, Fuyuki Ishikawa:
Stability analysis for safety of automotive multi-product lines: a search-based approach. 1241-1249 - Nuno Lourenço, J. Manuel Colmenar, José Ignacio Hidalgo, Oscar Garnica:
Structured grammatical evolution for glucose prediction in diabetic patients. 1250-1257 - David Lynch, Takfarinas Saber, Stepán Kucera, Holger Claussen, Michael O'Neill:
Evolutionary learning of link allocation algorithms for 5G heterogeneous wireless communications networks. 1258-1265 - Krzysztof Michalak:
Surrogate-based optimization for reduction of contagion susceptibility in financial systems. 1266-1274 - Icaro Marcelino Miranda, Claus Aranha, Marcelo Ladeira:
Classification of EEG signals using genetic programming for feature construction. 1275-1283 - Atsuhiro Miyagi, Youhei Akimoto, Hajime Yamamoto:
Well placement optimization under geological statistical uncertainty. 1284-1292 - Mehdi Neshat, Bradley Alexander, Nataliia Y. Sergiienko, Markus Wagner:
A hybrid evolutionary algorithm framework for optimising power take off and placements of wave energy converters. 1293-1301 - Guillaume Povéda, Olivier Regnier-Coudert, Florent Teichteil-Königsbuch, Gérard Dupont, Alexandre Arnold, Jonathan Guerra, Mathieu Picard:
Evolutionary approaches to dynamic earth observation satellites mission planning under uncertainty. 1302-1310 - Kenneth N. Reid, Jingpeng Li, Alexander E. I. Brownlee, Mathias Kern, Nadarajen Veerapen, Jerry Swan, Gilbert Owusu:
A hybrid metaheuristic approach to a real world employee scheduling problem. 1311-1318 - Daniel Rika, Dror Sholomon, Eli (Omid) David, Nathan S. Netanyahu:
A novel hybrid scheme using genetic algorithms and deep learning for the reconstruction of portuguese tile panels. 1319-1327 - Ibai Roman, Alexander Mendiburu, Roberto Santana, José Antonio Lozano:
Sentiment analysis with genetically evolved gaussian kernels. 1328-1337 - Vasilios Tsalavoutis, Constantinos Vrionis, Athanasios Tolis:
A hybrid multi-objective evolutionary algorithm for economic-environmental generation scheduling. 1338-1346 - Neil Urquhart, Silke Höhl, Emma Hart:
An illumination algorithm approach to solving the micro-depot routing problem. 1347-1355 - Tuong Manh Vu, Charlotte Probst, Joshua M. Epstein, Alan Brennan, Mark Strong, Robin C. Purshouse:
Toward inverse generative social science using multi-objective genetic programming. 1356-1363 - Neil S. Walton, John W. Sheppard, Joseph A. Shaw:
Using a genetic algorithm with histogram-based feature selection in hyperspectral image classification. 1364-1372 - Cameron R. Wolfe, Cem Celal Tutum, Risto Miikkulainen:
Functional generative design of mechanisms with recurrent neural networks and novelty search. 1373-1380 - Shuai Zhao, Piotr Dziurzanski, Michal Przewozniczek, Marcin Komarnicki, Leandro Soares Indrusiak:
Cloud-based dynamic distributed optimisation of integrated process planning and scheduling in smart factories. 1381-1389
Search-based software engineering
- Andrea Arcuri, Juan P. Galeotti:
SQL data generation to enhance search-based system testing. 1390-1398 - Carlos Oliveira, Aldeida Aleti, Yuan-Fang Li, Mohamed Abdelrazek:
Footprints of fitness functions in search-based software testing. 1399-1407 - Jeongju Sohn, Shin Yoo:
Why train-and-select when you can use them all?: ensemble model for fault localisation. 1408-1416 - Yuan Yuan, Wolfgang Banzhaf:
A hybrid evolutionary system for automatic software repair. 1417-1425 - Man Zhang, Bogdan Marculescu, Andrea Arcuri:
Resource-based test case generation for RESTful web services. 1426-1434 - Ziming Zhu, Li Jiao:
Improving search-based software testing by constraint-based genetic operators. 1435-1442
Theory
- Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
Runtime analysis of randomized search heuristics for dynamic graph coloring. 1443-1451 - Dogan Corus, Pietro S. Oliveto:
On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. 1452-1460 - Denis Antipov, Benjamin Doerr, Quentin Yang:
The efficiency threshold for the offspring population size of the (µ, λ) EA. 1461-1469 - Benjamin Doerr, Timo Kötzing:
Multiplicative up-drift. 1470-1478 - Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-adjusting mutation rates with provably optimal success rules. 1479-1487 - Benjamin Doerr:
A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. 1488-1496 - Per Kristian Lehre, Phan Trung Hai Nguyen:
Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise. 1497-1505 - Frank Neumann, Mojgan Pourhassan, Carsten Witt:
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. 1506-1514 - Andrew M. Sutton, Carsten Witt:
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. 1515-1522
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.