default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGECCO 2013: Amsterdam, The Netherlands
- Christian Blum, Enrique Alba:
Genetic and Evolutionary Computation Conference, GECCO '13, Amsterdam, The Netherlands, July 6-10, 2013. ACM 2013, ISBN 978-1-4503-1963-8
Ant colony optimization and swarm intelligence
- Mohammad Reza Bonyadi, Xiang Li, Zbigniew Michalewicz
:
A hybrid particle swarm with velocity mutation for constraint optimization problems. 1-8 - Ke Ding, Shaoqiu Zheng, Ying Tan:
A GPU-based parallel fireworks algorithm for optimization. 9-16 - Eliseo Ferrante, Edgar A. Duéñez-Guzmán, Ali Emre Turgut, Tom Wenseleers:
GESwarm: grammatical evolution for the automatic synthesis of collective behaviors in swarm robotics. 17-24 - Yue-jiao Gong, Jun Zhang:
Small-world particle swarm optimization with topology adaptation. 25-32 - Souvik Kundu, Subhodip Biswas, Swagatam Das, Ponnuthurai N. Suganthan:
Crowding-based local differential evolution with speciation-based memory archive for dynamic multimodal optimization. 33-40 - Kenneth Letendre, Melanie E. Moses:
Synergy in ant foraging strategies: memory and communication alone and in combination. 41-48 - Yannis Marinakis, Magdalene Marinaki:
Combinatorial expanding neighborhood topology particle swarm optimization for the vehicle routing problem with stochastic demands. 49-56 - Antonio Miguel Mora, Pablo García-Sánchez, Juan Julián Merelo Guervós, Pedro A. Castillo:
Migration study on a pareto-based island model for MOACOs. 57-64 - Ruby L. V. Moritz, Enrico Reich, Maik Schwarz, Matthias Bernt, Martin Middendorf:
Refined ranking relations for multi objective optimization andapplication to P-ACO. 65-72 - Fernando E. B. Otero, Alex Alves Freitas:
Improving the interpretability of classification rules discovered by an ant colony algorithm. 73-80 - Juan Rada-Vilela, Mengjie Zhang, Mark Johnston:
Optimal computing budget allocation in particle swarm optimization. 81-88 - Zhigang Ren, Muyi Wang, Jie Wu:
A novel multimodal-problem-oriented particle swarm optimization algorithm. 89-96 - Martin Craig Serpell, James E. Smith:
Initial application of ant colony optimisation to statistical disclosure control. 97-104 - Dimitris Souravlias, Konstantinos E. Parsopoulos:
Particle swarm optimization with budget allocation through neighborhood ranking. 105-112 - Costas Voglis, Panagiotis E. Hadjidoukas, Konstantinos E. Parsopoulos, Dimitris G. Papageorgiou, Isaac E. Lagaris:
Adaptive memetic particle swarm optimization with variable local search pool size. 113-120 - Gunnar Völkel, Markus Maucher, Hans A. Kestler:
Group-based ant colony optimization. 121-128 - Matthaus Martin Woolard, Jonathan Edward Fieldsend:
On the effect of selection and archiving operators in many-objective particle swarm optimisation. 129-136 - Bing Xue, Mengjie Zhang, Yan Dai, Will N. Browne:
PSO for feature construction and binary classification. 137-144 - Ming Yang, Zhihua Cai, Changhe Li, Jing Guan:
An improved adaptive differential evolution algorithm with population adaptation. 145-152 - Wei-jie Yu, Jun Zhang, Wei-neng Chen:
Adaptive artificial bee colony optimization. 153-158
Artificial life/robotics/evolvable hardware
- Josh C. Bongard, Gregory S. Hornby:
Combining fitness-based search and user modeling in evolutionary robotics. 159-166 - Nick Cheney, Robert MacCurdy, Jeff Clune, Hod Lipson:
Unshackling evolution: evolving soft robots with multiple materials and a powerful generative encoding. 167-174 - Antoine Cully, Jean-Baptiste Mouret:
Behavioral repertoire learning in robotics. 175-182 - Grant Dick:
A true finite-state baseline for tartarus. 183-190 - Cristian M. Dinu, Plamen Dimitrov, Berend Weel, A. E. Eiben:
Self-adapting fitness evaluation times for on-line evolution of simulated robots. 191-198 - Jorge C. Gomes, Anders Lyhne Christensen:
Generic behaviour similarity measures for evolutionary swarm robotics. 199-206 - Evert Haasdijk, Berend Weel, A. E. Eiben:
Right on the MONEE: combining task- and environment-driven evolution. 207-214 - Joel Lehman, Kenneth O. Stanley, Risto Miikkulainen:
Effective diversity maintenance in deceptive domains. 215-222 - Wei Li, Melvin Gauci, Roderich Gross:
A coevolutionary approach to learn animal behavior through controlled interaction. 223-230 - David Medernach, Taras Kowaliw, Conor Ryan, René Doursat:
Long-term evolutionary dynamics in heterogeneous cellular automata. 231-238 - Jared M. Moore, Anthony J. Clark, Philip K. McKinley:
Evolution of station keeping as a response to flows in an aquatic robot. 239-246 - Randal S. Olson, David B. Knoester, Christoph Adami:
Critical interplay between density-dependent predation and evolution of the selfish herd. 247-254 - Sebastian Risi, Kenneth O. Stanley:
Confronting the challenge of learning a flexible neural controller for a diversity of morphologies. 255-262 - Sebastian Risi, Daniel Cellucci, Hod Lipson:
Ribosomal robots: evolved designs inspired by protein folding. 263-270
Biological and biomedical applications
- Ahsan Raja Chowdhury, Madhu Chetty, Xuan Vinh Nguyen:
Inferring large scale genetic networks with S-system model. 271-278 - Nizamul Morshed, Madhu Chetty, Xuan Vinh Nguyen, Terry Caelli:
mDBN: motif based learning of gene regulatory networks using dynamic bayesian networks. 279-286 - Brian S. Olson, Kenneth A. De Jong, Amarda Shehu:
Off-lattice protein structure prediction with homologous crossover. 287-294 - Emmanuel Sapin, Ed Keedwell, Timothy M. Frayling:
Subset-based ant colony optimisation for the discovery of gene-gene interactions in genome wide association studies. 295-302 - Daniela Zaharie, Lavinia Moatar-Moleriu, Viorel Negru:
Particularities of evolutionary parameter estimation in multi-stage compartmental models of thymocyte dynamics. 303-310
Digital entertainment technologies and arts
- Alan Dorin:
Aesthetic selection and the stochastic basis of art, design and interactive evolutionary computation. 311-318 - Arne Eigenfeldt, Philippe Pasquier:
Evolving structures for electronic dance music. 319-326 - Jonathan Eisenmann, Matthew R. Lewis, Rick Parent:
Trace selection for interactive evolutionary algorithms. 327-334 - Dan Lessin, Don Fussell, Risto Miikkulainen:
Open-ended behavioral complexity for evolved virtual creatures. 335-342 - Antonios Liapis, Georgios N. Yannakakis, Julian Togelius:
Enhancements to constrained novelty search: two-population novelty search for generating game content. 343-350 - Diego Perez Liebana, Spyridon Samothrakis, Simon M. Lucas, Philipp Rohlfshagen:
Rolling horizon evolution versus tree search for navigation in single-player real-time games. 351-358
Estimation of distribution algorithms
- Peter A. N. Bosman, Dirk Thierens:
More concise and robust linkage learning by filtering and combining linkage hierarchies. 359-366 - Wei-Ming Chen, Chu-Yu Hsu, Tian-Li Yu, Wei-Che Chien:
Effects of discrete hill climbing on model building forestimation of distribution algorithms. 367-374 - Po-Chun Hsu, Tian-Li Yu:
A niching scheme for EDAs to reduce spurious dependencies. 375-382 - Ata Kabán, Jakramate Bootkrajang, Robert John Durrant:
Towards large scale continuous EDA: a random matrix theory perspective. 383-390 - Pablo Lanillos, Javier Yañez-Zuluaga, José Jaime Ruz, Eva Besada-Portas:
A bayesian approach for constrained multi-agent minimum time search in uncertain dynamic domains. 391-398 - Olivier Regnier-Coudert, John A. W. McCall, Mayowa Ayodele:
Geometric-based sampling for permutation optimization. 399-406 - Shih-Ming Wang, Jie-Wei Wu, Wei-Ming Chen, Tian-Li Yu:
Design of test problems for discrete estimation of distribution algorithms. 407-414
Evolution strategies and evolutionary programming
- Ouassim Ait ElHara, Anne Auger, Nikolaus Hansen:
A median success rule for non-elitist evolution strategies: study of feasibility. 415-422 - Dirk V. Arnold:
On the behaviour of the (1, λ)-es for a conically constrained problem. 423-430 - Tobias Glasmachers:
A natural evolution strategy with asynchronous strategy updates. 431-438 - Ilya Loshchilov, Marc Schoenauer, Michèle Sebag:
Intensive surrogate model exploitation in self-adaptive surrogate-assisted cma-es (saacm-es). 439-446 - Jianfeng Lu, Bin Li, Yaochu Jin:
An evolution strategy assisted by an ensemble of local Gaussian process models. 447-454 - Mikhail Zhabitsky, Evgeniya Zhabitskaya:
Asynchronous differential evolution with adaptive correlation matrix. 455-462
Evolutionary combinatorial optimization and metaheuristics
- Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende:
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. 463-470 - Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
On set-based local search for multiobjective combinatorial optimization. 471-478 - Matthieu Basseur, Adrien Goëffon:
Hill-climbing strategies on various landscapes: an empirical comparison. 479-486 - Florian Benz, Timo Kötzing:
An effective heuristic for the smallest grammar problem. 487-494 - David Chalupa:
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms. 495-502 - Wenxiang Chen, L. Darrell Whitley, Doug Hains, Adele E. Howe:
Second order partial derivatives for NK-landscapes. 503-510 - Daniil Chivilikhin, Vladimir Ulyantsev:
MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines. 511-518 - Dogan Corus, Per Kristian Lehre, Frank Neumann:
The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. 519-526 - Madalina M. Drugan:
Cartesian product of scalarization functions for many-objective QAP instances with correlated flow matrices: cartesian product of scalarization functions. 527-534 - Frederico A. C. A. Gonçalves, Frederico G. Guimarães, Marcone J. F. Souza:
An evolutionary multi-agent system for database query optimization. 535-542 - Julie Jacques, Julien Taillard, David Delerue, Laetitia Jourdan, Clarisse Dhaenens:
The benefits of using multi-objectivization for mining pittsburgh partial classification rules in imbalanced and discrete data. 543-550 - James Styles, Holger H. Hoos:
Ordered racing protocols for automatically configuring algorithms for scaling performance. 551-558 - Yuan Yuan, Hua Xu:
A memetic algorithm for the multi-objective flexible job shop scheduling problem. 559-566 - Shiu Yin Yuen, Chi Kin Chow, Xin Zhang:
Which algorithm should i choose at any point of the search: an evolutionary portfolio approach. 567-574
Evolutionary multiobjective optimization
- Karl Bringmann, Tobias Friedrich:
Parameterized average-case complexity of the hypervolume indicator. 575-582 - Andre Britto, Sanaz Mostaghim, Aurora T. R. Pozo:
Iterated multi-swarm: a multi-swarm algorithm based on archiving methods. 583-590 - Roman Denysiuk, Lino A. Costa, Isabel A. Espírito-Santo:
Many-objective optimization using differential evolution with variable-wise mutation restriction. 591-598 - Martin Drozdik, Hernán E. Aguirre, Kiyoshi Tanaka:
Attempt to reduce the computational complexity in multi-objective differential evolution algorithms. 599-606 - Richard M. Everson, David J. Walker, Jonathan E. Fieldsend:
Edges of mutually non-dominating sets. 607-614 - Félix-Antoine Fortin, Simon Grenier, Marc Parizeau:
Generalizing the improved run-time complexity algorithm for non-dominated sorting. 615-622 - Félix-Antoine Fortin, Marc Parizeau:
Revisiting the NSGA-II crowding-distance computation. 623-630 - Ahmed Kafafy, Stéphane Bonnevay, Ahmed Bounekkar:
A hybrid evolutionary approach with search strategy adaptation for mutiobjective optimization. 631-638 - Natsuki Kusuno, Hernán E. Aguirre, Kiyoshi Tanaka, Masataka Koishi:
Evolutionary multi-objective optimization to attain practically desirable solutions. 639-646 - Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Two-stage non-dominated sorting and directed mating for solving problems with multi-objectives and constraints. 647-654 - Christopher Priester, Kaname Narukawa, Tobias Rodemann:
A comparison of different algorithms for the calculation of dominated hypervolumes. 655-662 - Álvaro Rubio-Largo, Qingfu Zhang, Miguel A. Vega-Rodríguez:
MOEA/D for traffic grooming in WDM optical networks. 663-670 - Kiyoharu Tagawa, Akihiro Imamura:
Many-hard-objective optimization using differential evolution based on two-stage constraint-handling. 671-678 - Denny Verbeeck, Francis Maes, Kurt De Grave, Hendrik Blockeel:
Multi-objective optimization with surrogate trees. 679-686 - Markus Wagner, Frank Neumann:
A fast approximation-guided evolutionary multi-objective algorithm. 687-694 - Rui Wang, Robin C. Purshouse, Peter J. Fleming:
On finding well-spread pareto optimal solutions by preference-inspired co-evolutionary algorithm. 695-702
Generative and developmental systems
- Konstantin Lakhman, Mikhail Burtsev:
Neuroevolution results in emergence of short-term memory in multi-goal environment. 703-710 - Alan J. Lockett, Risto Miikkulainen:
Neuroannealing: martingale optimization for neural networks. 711-718 - Gregory Morse, Sebastian Risi, Charles R. Snyder, Kenneth O. Stanley:
Single-unit pattern generators for quadruped locomotion. 719-726 - Michael E. Palmer:
Gene networks have a predictive long-term fitness. 727-734 - Justin K. Pugh, Kenneth O. Stanley:
Evolving multimodal controllers with HyperNEAT. 735-742 - John Rieffel:
Heterochronic scaling of developmental durations in evolved soft robots. 743-750 - Eivind Samuelsen, Kyrre Glette, Jim Tørresen:
A hox gene inspired generative approach to evolving robot morphology. 751-758 - Thomas G. van den Berg, Shimon Whiteson:
Critical factors in the performance of hyperNEAT. 759-766 - Dennis Wilson, Emmanuel Awa, Sylvain Cussat-Blanc, Kalyan Veeramachaneni, Una-May O'Reilly:
On learning to generate wind farm layouts. 767-774
Genetic algorithms
- Benjamin Doerr, Carola Doerr, Franziska Ebel:
Lessons from the black-box: fast crossover-based genetic algorithms. 781-788 - Carola Doerr, François-Michel De Rainville:
Constructing low star discrepancy point sets with genetic algorithms. 789-796 - Christian Gießen:
Hybridizing evolutionary algorithms with opportunistic local search. 797-804 - Doug Hains, L. Darrell Whitley, Adele E. Howe, Wenxiang Chen:
Hyperplane initialized local search for MAXSAT. 805-812 - António Manuel Rodrigues Manso, Luís Miguel Parreira Correia:
A multiset genetic algorithm for the optimization of deceptive problems. 813-820 - Jean Paulo Martins, Alexandre Cláudio Botazzo Delbem:
The influence of linkage-learning in the linkage-tree GA when solving multidimensional knapsack problems. 821-828 - Juan Julián Merelo Guervós, Pedro A. Castillo, Antonio Mora García, Anna Isabel Esparcia-Alcázar:
Improving evolutionary solutions to the game of mastermind using an entropy-based scoring method. 829-836 - Pietro S. Oliveto, Christine Zarges:
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. 837-844 - Tiago Paixão, Nick Barton:
A variance decomposition approach to the analysis of genetic algorithms. 845-852 - Krzysztof L. Sadowski, Peter A. N. Bosman, Dirk Thierens:
On the usefulness of linkage processing for solving MAX-SAT. 853-860 - Boris Shabash, Kay C. Wiese:
pEvoSAT: a novel permutation based genetic algorithm for solving the boolean satisfiability problem. 861-868 - Anabela Simões, Ernesto Costa:
Extended virtual loser genetic algorithm for the dynamic traveling salesman problem. 869-876 - Dirk Thierens, Peter A. N. Bosman:
Hierarchical problem solving with the linkage tree genetic algorithm. 877-884
Genetic programming
- Aaron Atwater, Malcolm I. Heywood:
Benchmarking pareto archiving heuristics in the presence of concept drift: diversity versus age. 885-892 - Alexander Bailey, Beatrice M. Ombuki-Berman, Mario Ventresca:
Automatic inference of hierarchical graph models using genetic programming with an application to cortical networks. 893-900 - Tomás Bartos, Tomás Skopal, Juraj Mosko:
Efficient indexing of similarity models with inequality symbolic regression. 901-908 - Grant Dick:
An effective parse tree representation for tartarus. 909-916 - Wenlong Fu, Mark Johnston, Mengjie Zhang:
Genetic programming for edge detection using multivariate density. 917-924 - Marco Gaudesi, Giovanni Squillero, Alberto Paolo Tonda:
An efficient distance metric for linear genetic programming. 925-932 - Brian W. Goldman, William F. Punch:
Length bias and search limitations in cartesian genetic programming. 933-940 - Krzysztof Krawiec, Tomasz Pawlak:
Approximating geometric crossover by semantic backpropagation. 941-948 - Krzysztof Krawiec, Jerry Swan:
Pattern-guided genetic programming. 949-956