default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGECCO 2017: Berlin, Germany
- Peter A. N. Bosman:
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, July 15-19, 2017. ACM 2017, ISBN 978-1-4503-4920-8
Keynote talks
- Francesca D. Ciccarelli:
Computational approaches in cancer genomics. 1 - Hod Lipson:
Curious and creative machines. 2 - Drew Purves, Chrisantha Fernando:
Evolving brains in evolving environments. 3
Ant colony optimization and swarm intelligence
- Sujata Baral, Swakkhar Shatabda
, Mahmood A. Rashid:
CycloAnt: sequencing cyclic peptides using hybrid ants. 4-11 - Christopher Wesley Cleghorn, Andries P. Engelbrecht:
Fitness-distance-ratio particle swarm optimization: stability analysis. 12-18 - Huw Lloyd, Martyn Amos:
Analysis of independent roulette selection in parallel ant colony optimization. 19-26 - Silja Meyer-Nieberg:
Coordinating a team of searchers: of ants, swarms, and slime molds. 27-34 - Sara Perez-Carabaza, Julian Bermudez-Ortega, Eva Besada-Portas, José Antonio López Orozco, Jesús Manuel de la Cruz:
A multi-UAV minimum time search planner based on ACOR. 35-42 - Peter Frank Perroni, Daniel Weingaertner, Myriam Regattieri Delgado:
Estimating stop conditions of swarm based stochastic metaheuristic algorithms. 43-50 - Chengyan Wang, Bing Xue, Lin Shang:
PSO-based parameters selection for the bilateral filter in image denoising. 51-58
Complex systems (artificial life/artificial immune systems/robotics/evolvable hardware/generative and developmental systems)
- Nathanaël Aubert-Kato, Charles Fosseprez, Guillaume Gines, Ibuki Kawamata, Quang Huy Dinh, Leo Cazenille, Andre Estevez-Torres, Masami Hagiya, Yannick Rondelez, Nicolas Bredèche:
Evolutionary optimization of self-assembly in a swarm of bio-micro-robots. 59-66 - Jonathan C. Brant, Kenneth O. Stanley:
Minimal criterion coevolution: a new approach to open-ended search. 67-74 - Dogan Corus, Pietro S. Oliveto, Donya Yazdani:
On the runtime analysis of the opt-IA artificial immune system. 83-90 - Jean Disset, Dennis G. Wilson, Sylvain Cussat-Blanc, Stéphane Sanchez, Hervé Luga, Yves Duthen:
A comparison of genetic regulatory network dynamics and encoding. 91-98 - Adam Gaier, Alexander Asteroth, Jean-Baptiste Mouret:
Data-efficient exploration, optimization, and modeling of diverse designs through surrogate-assisted illumination. 99-106 - Daniele Gravina, Antonios Liapis, Georgios N. Yannakakis:
Coupling novelty and surprise for evolutionary divergence. 107-114 - Chathika Gunaratne, Ivan Garibay:
Alternate social theory discovery using genetic programming: towards better understanding the artificial anasazi. 115-122 - Gerard David Howard:
On self-adaptive rate restarts for evolutionary robotics with real rotorcraft. 123-130 - Sam Kriegman, Nick Cheney, Francesco Corucci, Josh C. Bongard:
A minimal developmental model can increase evolvability in soft robots. 131-138 - Elliot Meyerson, Risto Miikkulainen:
Discovering evolutionary stepping stones through behavior domination. 139-146 - Jared M. Moore, Anthony J. Clark, Philip K. McKinley:
Effect of animat complexity on the evolution of hierarchical control. 147-154 - Andreas Steyven, Emma Hart, Ben Paechter:
An investigation of environmental influence on the benefits of adaptation mechanisms in evolutionary swarm robotics. 155-162 - Payam Zahadat, Daniel Nicolas Hofstadler, Thomas Schmickl:
Vascular morphogenesis controller: a generative model for developing morphology of artificial structures. 163-170
Digital entertainment technologies and arts
- Bradley Alexander, James Kortman, Aneta Neumann:
Evolution of artistic image variants through feature based diversity optimisation. 171-178 - Lauren E. Gillespie, Gabriela R. Gonzalez, Jacob Schrum:
Comparing direct and indirect encodings using both raw and hand-designed features in tetris. 179-186 - Niels Justesen, Sebastian Risi:
Continual online evolutionary planning for in-game build order adaptation in StarCraft. 187-194 - Stephen Kelly, Malcolm I. Heywood:
Multi-task learning in Atari video games with emergent tangled program graphs. 195-202 - Antonios Liapis:
Multi-segment evolution of dungeon game levels. 203-210 - Marco Scirea, Peter W. Eklund, Julian Togelius, Sebastian Risi:
Can you feel it?: evaluation of affective expression in music generated by MetaCompose. 211-218
Evolutionary combinatorial optimization and metaheuristics
- Mosab Bazargani, Fernando G. Lobo:
Parameter-less late acceptance hill-climbing. 219-226 - Aymeric Blot, Laetitia Jourdan, Marie-Éléonore Kessaci-Marmion:
Automatic design of multi-objective local search algorithms: case study on a bi-objective permutation flowshop scheduling problem. 227-234 - Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating optimization problems using EAs on scale-free networks. 235-242 - Nguyen Dang, Leslie Pérez Cáceres, Patrick De Causmaecker, Thomas Stützle:
Configuring irace using surrogate configuration benchmarks. 243-250 - Rodney O. M. Diana, Sérgio Ricardo de Souza, Elizabeth F. Wanner, Moacir F. de França Filho:
Hybrid metaheuristic for combinatorial optimization based on immune network for optimization and VNS. 251-258 - Noémi Gaskó, Florentin Bota, Mihai Suciu, Rodica Ioana Lung:
Community structure detection in multipartite networks: a new fitness measure. 259-265 - Sebastian Herrmann, Matthias Herrmann, Gabriela Ochoa, Franz Rothlauf:
Shaping communities of local optima by perturbation strength. 266-273 - Md. Jakirul Islam, Xiaodong Li, Kalyanmoy Deb:
Multimodal truss structure design using bilevel and niching based evolutionary algorithms. 274-281 - Deepak Karunakaran, Yi Mei, Gang Chen, Mengjie Zhang:
Toward evolving dispatching rules for dynamic job shop scheduling under uncertainty. 282-289 - Yuxin Liu, Yi Mei, Mengjie Zhang, Zili Zhang:
Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem. 290-297 - Weichen Liu, Thomas Weise, Yuezhong Wu, Qi Qi:
Combining two local searches with crossover: an efficient hybrid algorithm for the traveling salesman problem. 298-305 - Luca Mariot, Stjepan Picek, Domagoj Jakobovic, Alberto Leporati:
Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata. 306-313 - Laurent Moalic, Alexandre Gondran:
Heuristic rope team: a parallel algorithm for graph coloring. 314-320 - Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah:
Just-in-time batch scheduling problem with two-dimensional bin packing constraints. 321-328 - Danilo Sipoli Sanches, L. Darrell Whitley, Renato Tinós:
Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover. 329-336 - Danilo Sipoli Sanches, L. Darrell Whitley, Renato Tinós:
Improving an exact solver for the traveling salesman problem using partition crossover. 337-344 - Peter Sanders, Christian Schulz, Darren Strash, Robert Williger:
Distributed evolutionary k-way node separators. 345-352 - Alexandre Sawczuk da Silva, Yi Mei, Hui Ma, Mengjie Zhang:
Fragment-based genetic programming for fully automated multi-objective web service composition. 353-360 - Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
On feasible and infeasible search for equitable graph coloring. 369-376 - Sarah L. Thomson, Fabio Daolio, Gabriela Ochoa:
Comparing communities of optima with funnels in combinatorial fitness landscapes. 377-384
Evolutionary machine learning
- Haya Abdullah Alhakbani, Mohammad Majid al-Rifaie:
Feature selection using stochastic diffusion search. 385-392 - Grant Dick:
Sensitivity-like analysis for feature selection in genetic programming. 401-408 - Madalina M. Drugan:
PAC models in stochastic multi-objective multi-armed bandits. 409-416 - Effat Farhana, Steffen Heber:
Biogeography-based rule mining for classification. 417-424 - Alexander Hagg, Maximilian Mensing, Alexander Asteroth:
Evolving parsimonious networks by mixing activation functions. 425-432 - Ayah Helal, Fernando E. B. Otero:
Automatic design of ant-miner mixed attributes for classification rule discovery. 433-440 - Shauharda Khadka, Jen Jen Chung, Kagan Tumer:
Evolving memory-augmented neural architecture for deep memory problems. 441-448 - Andrew Lensen, Bing Xue, Mengjie Zhang:
GPGC: genetic programming for automatic clustering using a flexible non-hyper-spherical graph-based approach. 449-456 - Pawel Liskowski, Wojciech Jaskowski:
Accelerating coevolution with adaptive matrix factorization. 457-464 - Filip Matzner:
Neuroevolution on the edge of chaos. 465-472 - Masaya Nakata, Will N. Browne, Tomoki Hamagami, Keiki Takadama:
Theoretical XCS parameter settings of learning accurate classifiers. 473-480 - Pablo Ribalta Lorenzo, Jakub Nalepa, Michal Kawulok, Luciano Sánchez Ramos, José Ranilla Pastor:
Particle swarm optimization for hyper-parameter selection in deep neural networks. 481-488 - Andrew Sohn, Randal S. Olson, Jason H. Moore:
Toward the automated analysis of complex diseases in genome-wide association studies using genetic programming. 489-496 - Masanori Suganuma, Shinichi Shirakawa, Tomoharu Nagao:
A genetic programming approach to designing convolutional neural network architectures. 497-504 - Takato Tatsumi, Hiroyuki Sato, Keiki Takadama:
Automatic adjustment of selection pressure based on range of reward in learning classifier system. 505-512 - Duc Minh Tran, Claudia d'Amato, Nguyen Thanh Binh, Andrea G. B. Tettamanzi:
An evolutionary algorithm for discovering multi-relational association rules in the semantic web. 513-520 - Cao Truong Tran, Mengjie Zhang, Peter Andreae, Bing Xue:
Multiple imputation and genetic programming for classification with incomplete data. 521-528 - Jason Zutty, Gregory Rohling:
Solving test case based problems with fuzzy dominance. 529-536
Evolutionary multiobjective optimization
- Anton Bouter, Ngoc Hoang Luong, Cees Witteveen, Tanja Alderliesten, Peter A. N. Bosman:
The multi-objective real-valued gene-pool optimal mixing evolutionary algorithm. 537-544 - Marlon Alexander Braun, Lars Heling, Pradyumn Kumar Shukla, Hartmut Schmeck:
Multimodal scalarized preferences in multi-objective optimization. 545-552 - Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt:
Speeding up evolutionary multi-objective optimisation through diversity-based parent selection. 553-560 - Maha Elarbi, Slim Bechikh, Lamjed Ben Said:
On the importance of isolated solutions in constrained decomposition-based many-objective optimization. 561-568 - Fillipe Goulart, Sílvio T. Borges, Fernanda C. Takahashi, Felipe Campelo:
Robust multiobjective optimization using regression models and linear subproblems. 569-576 - Raquel Hernández Gómez, Carlos A. Coello Coello:
A hyper-heuristic of scalarizing functions. 577-584 - Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Reference point specification in hypervolume calculation for fair comparison and efficient search. 585-592 - Luis Martí, Arsène Fansi Tchango, Laurent Navarro, Marc Schoenauer:
Progressively adding objectives: a case study in anomaly detection. 593-600 - Krzysztof Michalak:
Simulation-based crossover for the firefighter problem. 601-608 - Hugo Monzón, Hernán E. Aguirre, Sébastien Vérel, Arnaud Liefooghe, Bilel Derbel, Kiyoshi Tanaka:
Closed state model for understanding the dynamics of MOEAs. 609-616 - Yusuke Nojima, Yuki Tanigaki, Hisao Ishibuchi:
Multiobjective data mining from solutions by evolutionary multiobjective optimization. 617-624 - Proteek Chandan Roy, Rayan Hussein, Kalyanmoy Deb:
Metamodeling for multimodal selection functions in evolutionary multi-objective optimization. 625-632 - Ryoji Tanabe, Akira Oyama:
Benchmarking MOEAs for multi- and many-objective optimization using an unbounded external archive. 633-640 - Mengyuan Wu, Sam Kwong, Yuheng Jia, Ke Li, Qingfu Zhang:
Adaptive weights generation for decomposition-based multi-objective optimization using Gaussian process regression. 641-648 - Ilya Yakupov, Maxim Buzdalov:
Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. 649-656
Evolutionary numerical optimization
- Abbas Abdolmaleki, Bob Price, Nuno Lau, Luís Paulo Reis, Gerhard Neumann:
Deriving and improving CMA-ES with information geometric trust regions. 657-664 - Dirk V. Arnold:
Reconsidering constraint release for active-set evolution strategies. 665-672 - Samineh Bagheri, Wolfgang Konen, Richard Allmendinger, Jürgen Branke, Kalyanmoy Deb, Jonathan E. Fieldsend, Domenico Quagliarella, Karthik Sindhya:
Constraint handling in efficient global optimization. 673-680 - Nacim Belkhir, Johann Dréo, Pierre Savéant, Marc Schoenauer:
Per instance algorithm configuration of CMA-ES with limited budget. 681-688 - Hans-Georg Beyer, Michael Hellwig:
Analysis of the pcCMSA-ES on the noisy ellipsoid model. 689-696 - Julien Blanchard, Charlotte Beauthier, Timoteo Carletti:
A cooperative co-evolutionary algorithm for solving large-scale constrained problems with interaction detection. 697-704 - Anton Bouter, Tanja Alderliesten, Cees Witteveen, Peter A. N. Bosman:
Exploiting linkage information in real-valued optimization with the real-valued gene-pool optimal mixing evolutionary algorithm. 705-712 - S. C. Maree, Tanja Alderliesten, Dirk Thierens, Peter A. N. Bosman:
Niching an estimation-of-distribution algorithm by hierarchical Gaussian mixture learning. 713-720 - Hidekazu Miyazawa, Youhei Akimoto:
Effect of the mean vector learning rate in CMA-ES. 721-728 - Ryoji Tanabe, Alex Fukunaga:
TPAM: a simulation-based model for quantitatively analyzing parameter adaptation methods. 729-736 - Sander van Rijn, Hao Wang, Bas van Stein, Thomas Bäck:
Algorithm configuration data mining for CMA evolution strategies. 737-744
Genetic algorithms
- Ping-Lin Chen, Chun-Jen Peng, Chang-Yi Lu, Tian-Li Yu:
Two-edge graphical linkage model for DSMGA-II. 745-752 - Francisco Chicano, L. Darrell Whitley, Gabriela Ochoa, Renato Tinós:
Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. 753-760 - Fernando Concatto, Wellington Zunino, Luigi A. Giancoli, Rafael de Santiago, Luís C. Lamb:
Genetic algorithm for epidemic mitigation by removing relationships. 761-768 - Carlo Contaldi, Fatemeh Vafaee, Peter C. Nelson:
The role of crossover operator in bayesian network structure learning performance: a comprehensive comparative study and new insights. 769-776 - Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen:
Fast genetic algorithms. 777-784 - André Homem Dornas, Flávio Vinícius Cruzeiro Martins, João Fernando Machry Sarubbi, Elizabeth Fialho Wanner:
Real-polarized genetic algorithm for the three-dimensional bin packing problem. 785-792 - Alex Gliesch, Marcus Ritt, Mayron César O. Moreira:
A genetic algorithm for fair land allocation. 793-800 - Cezary Z. Janikow, Mark Hauschild:
Automatic generation of domain-specific genetic algorithm operators using the hierarchical bayesian optimization algorithm. 801-808 - Sung-Chi Li, Tian-Li Yu:
Speeding up DSMGA-II on CUDA platform. 809-816 - Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann:
Evolutionary image composition using feature covariance matrices. 817-824 - Roberto Santana, José Antonio Lozano:
Different scenarios for survival analysis of evolutionary algorithms. 825-832 - Stefano Tognazzi, Mirco Tribastone, Max Tschaikowski, Andrea Vandin:
EGAC: a genetic algorithm to compare chemical reaction networks. 833-840 - Jheng-Ying Yu, I-Ting Chen, Tian-Li Yu:
A diversity preservation scheme for DSMGA-II to conquer the hierarchical difficulty. 841-848
General evolutionary computation and hybrids
- Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation. 849-856 - Andrei Lissovoi, Dirk Sudholt, Markus Wagner, Christine Zarges:
Theoretical results on bet-and-run as an initialisation strategy. 857-864 - Martin Pilát, Roman Neruda:
Parallel evolutionary algorithm with interleaving generations. 865-872 - Alma As-Aad Mohammad Rahat, Richard M. Everson, Jonathan E. Fieldsend:
Alternative infill strategies for expensive multi-objective optimisation. 873-880 - Vanessa Volz, Günter Rudolph, Boris Naujoks:
Investigating uncertainty propagation in surrogate-assisted evolutionary algorithms. 881-888 - Hao Wang, Bas van Stein, Michael T. M. Emmerich, Thomas Bäck:
Time complexity reduction in efficient global optimization using cluster kriging. 889-896 - Mark Wineberg, Sebastian Lenartowicz:
Reexpressing problematic optimization data: creating a workflow for the statistical analysis of multifactorial EC experiments. 897-904 - Martin Zaefferer, Andreas Fischbach, Boris Naujoks, Thomas Bartz-Beielstein:
Simulation-based test functions for optimization algorithms. 905-912
Genetic programming
- Andrés Felipe Cruz-Salinas, Jonatan Gómez Perdomo:
Self-adaptation of genetic operators through genetic programming techniques. 913-920 - Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding bloat in genetic programming. 921-928 - Ivo Gonçalves, Sara Silva, Carlos M. Fonseca, Mauro Castelli:
Unsure when to stop?: ask your semantic neighbors. 929-936 - Thomas Helmuth, Nicholas Freitag McPhee, Edward R. Pantridge, Lee Spector:
Improving generalization of evolved programs through automatic simplification. 937-944 - Sara Khanchi, Malcolm I. Heywood, Nur Zincir-Heywood:
Properties of a GP active learning framework for streaming data with class imbalance. 945-952 - Krzysztof Krawiec, Iwo Bladek, Jerry Swan:
Counterexample-driven genetic programming. 953-960 - William G. La Cava, Jason H. Moore:
Ensemble representation learning: an analysis of fitness and survival for wrapper-based genetic programming methods. 961-968 - Pawel Liskowski, Krzysztof Krawiec:
Discovery of search objectives in continuous domains. 969-976 - Eric Medvet, Fabio Daolio, Danny Tagliapietra:
Evolvability in grammatical evolution. 977-984 - Luis Fernando Miranda, Luiz Otávio Vilas Boas Oliveira, Joao Francisco B. S. Martins, Gisele L. Pappa:
How noisy data affects geometric semantic genetic programming. 985-992 - Alberto Moraglio, Krzysztof Krawiec:
Geometric semantic genetic programming for recursive boolean programs. 993-1000 - Thuong Pham Thi, Nguyen Xuan Hoai, Xin Yao:
Combining conformal prediction and genetic programming for symbolic interval regression. 1001-1008 - Robert J. Smith, Malcolm I. Heywood:
Coevolving deep hierarchies of programs to solve complex tasks. 1009-1016 - Léo Françoso Dal Piccol Sotto, Vinícius Veloso de Melo:
A probabilistic linear genetic programming with stochastic context-free grammar for solving symbolic regression problems. 1017-1024 - Amir Tavafi, Wolfgang Banzhaf:
A hybrid genetic programming decision making system for RoboCup soccer simulation. 1025-1032 - Cao Truong Tran, Mengjie Zhang, Peter Andreae, Bing Xue:
Genetic programming based feature construction for classification with incomplete data. 1033-1040 - Marco Virgolin, Tanja Alderliesten, Cees Witteveen, Peter A. N. Bosman:
Scalable genetic programming by gene-pool optimal mixing and input-space entropy-based building-block learning. 1041-1048
Real world applications
- Jesimar da Silva Arantes, Márcio da Silva Arantes, Claudio Fabiano Motta Toledo, Onofre Trindade Júnior, Brian C. Williams:
An embedded system architecture based on genetic algorithms for mission and safety planning with UAV. 1049-1056 - Rolando Armas, Hernán E. Aguirre, Kiyoshi Tanaka:
Multi-objective optimization of level of service in urban transportation. 1057-1064 - Bradley L. Barnhart, Zhichao Lu, Moriah Bostian, Ankur Sinha, Kalyanmoy Deb, Luba Kurkalova, Manoj Jha, Gerald Whittaker:
Handling practicalities in agricultural policy optimization for water quality improvements. 1065-1072 - Aniruddha Basak, Ole J. Mengshoel, Chinmay Kulkarni, Kevin M. Schmidt, Prathi Shastry, Rao Rapeta:
Optimizing the decomposition of time series using evolutionary algorithms: soil moisture analytics. 1073-1080 - Sandeep V. Belure, Ofer M. Shir, Vikas Nanda:
Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches. 1081-1088 - Keith J. Drew, Robert B. Heckendorn, Ahmed Abdel-Rahim, Homaja Pydi Kumar Marisetty, Anton Q. Stalick:
Evolving a real-time evacuation for urban disaster management. 1089-1096 - Jonathan E. Fieldsend:
University staff teaching allocation: formulating and optimising a many-objective problem. 1097-1104 - Scott Forer, Logan Michael Yliniemi:
Monopolies can exist in unmanned airspace. 1105-1112 - Myoung Hoon Ha, Byung Ro Moon:
The evolution of neural network-based chart patterns: a preliminary study. 1113-1120 - Emma Hart, Kevin Sim, Barry Gardiner, Kana Kamimura:
A hybrid method for feature construction and selection to improve wind-damage prediction in the forestry sector. 1121-1128 - James Alexander Hughes, Mark Daley:
Searching for nonlinear relationships in fMRI data with symbolic regression. 1129-1136 - Angus Kenny, Xiaodong Li, Andreas T. Ernst, Dhananjay R. Thiruvady:
Towards solving large-scale precedence constrained production scheduling problems in mining. 1137-1144 - Jerzy Kozyra, Harold Fellermann, Ben Shirt-Ediss, Annunziata Lopiccolo, Natalio Krasnogor:
Optimizing nucleic acid sequences for a molecular data recorder. 1145-1152 - Walter O. Krawec, Michael G. Nelson, Eric P. Geiss:
Automatic generation of optimal quantum key distribution protocols. 1153-1160 - Pavel Krömer, Jana Heckenbergerova, Petr Musílek:
Accurate mixed weibull distribution fitting by differential evolution. 1161-1168 - Yigal Lahav, Ofer M. Shir, Dror Noy:
Solving structures of pigment-protein complexes as inverse optimization problems using decomposition. 1169-1176 - Piotr Lipinski:
Evolutionary approach to optimization of data representation for classification of patterns in financial ultra-high frequency time series. 1177-1184 - Zhichao Lu, Kalyanmoy Deb, Erik D. Goodman, John M. Wassick:
Solving a supply-chain management problem using a bilevel approach. 1185-1192 - Risto Miikkulainen, Neil Iscoe, Aaron Shagrin, Ron Cordell, Sam Nazari, Cory Schoolland, Myles Brundage, Jonathan Epstein, Randy Dean, Gurmeet Lamba:
Conversion rate optimization through evolutionary computation. 1193-1199 - Robin Mueller-Bady, Martin Kappes, Inmaculada Medina-Bulo, Francisco Palomo-Lozano:
Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm. 1200-1207 - Vincent R. Ragusa, H. David Mathias, Vera A. Kazakova, Annie S. Wu:
Enhanced genetic path planning for autonomous flight. 1208-1215 - Cristian Ramírez-Atencia, Sanaz Mostaghim, David Camacho:
A knee point based evolutionary multi-objective optimization for mission planning problems. 1216-1223 - Krzysztof L. Sadowski, Marjolein C. van der Meer, Ngoc Hoang Luong, Tanja Alderliesten, Dirk Thierens, Rob van der Laarse, Yury Niatsetski, Arjan Bel, Peter A. N. Bosman:
Exploring trade-offs between target coverage, healthy tissue sparing, and the placement of catheters in HDR brachytherapy for prostate cancer using a novel multi-objective model-based mixed-integer evolutionary algorithm. 1224-1231 - Saeideh Shirinzadeh, Mathias Soeken, Daniel Große, Rolf Drechsler:
An adaptive prioritized ε-preferred evolutionary algorithm for approximate BDD optimization. 1232-1239 - Daniel H. Stolfi, Enrique Alba:
Computing new optimized routes for GPS navigators using evolutionary algorithms. 1240-1247 - Da-Zhao Tan, Wei-Neng Chen, Jun Zhang, Wei-Jie Yu:
Fast pedestrian detection using multimodal estimation of distribution algorithms. 1248-1255 - Silviu Tofan, Richard Allmendinger, Manuela Zanda, Olly Stephens:
Heuristic allocation of computational resources. 1256-1263 - Neil Urquhart, Achille Fonzone:
Evolving solution choice and decision support for a real-world optimisation problem. 1264-1271 - Eric A. Yu, Jin Yeom, Cem Celal Tutum, Etienne Vouga, Risto Miikkulainen:
Evolutionary decomposition for 3D printing. 1272-1279
Search-based software engineering
- Brendan Cody-Kenny, Michael Fenton, Adrian Ronayne, Eoghan Considine, Thomas McGuire, Michael O'Neill:
A search for improved performance in regular expressions. 1280-1287 - Philippe Galinier, Segla Kpodjedo, Giulio Antoniol:
A penalty-based Tabu search for constrained covering arrays. 1288-1294 - Dahyun Kang, Jeongju Sohn, Shin Yoo:
Empirical evaluation of conditional operators in GP based fault localization. 1295-1302 - Marouane Kessentini, Troh Josselin Dea, Ali Ouni:
A context-based refactoring recommendation approach using simulated annealing: two industrial case studies. 1303-1310 - Remo Lachmann, Michael Felderer, Manuel Nieke, Sandro Schulze, Christoph Seidl, Ina Schaefer:
Multi-objective black-box test case selection for system testing. 1311-1318 - Safdar Aqeel Safdar, Hong Lu, Tao Yue, Shaukat Ali:
Mining cross product line rules with multi-objective search and machine learning. 1319-1326 - Marcel Wever, Lorijn van Rooijen, Heiko Hamann:
Active coevolutionary learning of requirements specifications from examples. 1327-1334 - Xiong Xu, Ziming Zhu, Li Jiao:
An adaptive fitness function based on branch hardness for search based testing. 1335-1342
Theory
- Maxim Buzdalov, Benjamin Doerr:
Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. 1343-1350 - Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) evolutionary algorithm with self-adjusting mutation rate. 1351-1358 - Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island models meet rumor spreading. 1359-1366 - Benjamin Doerr, Carola Doerr, Timo Kötzing:
Unknown solution length problems with no asymptotically optimal run time. 1367-1374 - Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by swaps with noisy comparisons. 1375-1382 - Per Kristian Lehre, Phan Trung Hai Nguyen:
Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. 1383-1390 - Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt:
When is it beneficial to reject improvements? 1391-1398 - Chao Qian, Chao Bian, Wu Jiang, Ke Tang:
Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise. 1399-1406 - Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. 1407-1414 - Carsten Witt:
Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. 1415-1422
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.
last updated on 2025-10-31 22:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
