Skip Nav Destination

CogNet

MIT Press CogNet is the essential research tool for scholars in the brain and cognitive sciences. Visit the CogNet information page for more information.

MO-SMAC: Multiobjective Sequential Model-Based Algorithm Configuration

Jeroen G. Rook; Carolin Benjamins; Jakob Bossek; Heike Trautmann; Holger H. Hoos; Marius Lindauer

https://doi.org/10.1162/evco_a_00371

Solving Many-Objective Optimization Problems Based on PF Shape Classification and Vector Angle Selection

Y. T. Wu; F. Z. Ge; D. B. Chen; L. Shi

https://doi.org/10.1162/evco_a_00373

Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single-Objective and Multiobjective Continuous Optimization Problems

Moritz Vinzent Seiler; Pascal Kerschke; Heike Trautmann

https://doi.org/10.1162/evco_a_00372

Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables *

Frank Neumann; Carsten Witt

https://doi.org/10.1162/evco_a_00355

Tail Bounds on the Runtime of Categorical Compact Genetic Algorithm

Ryoki Hamano; Kento Uchida; Shinichi Shirakawa; Daiki Morinaga; Youhei Akimoto

https://doi.org/10.1162/evco_a_00361

Evolutionary Sparsity Regularisation-Based Feature Selection for Binary Classification

Bach Hoai Nguyen; Bing Xue; Mengjie Zhang

https://doi.org/10.1162/evco_a_00358

Landscape Analysis for Surrogate Models in the Evolutionary Black-Box Context

Zbyněk Pitra; Jan Koza; Jiří Tumpach; Martin Holeňa

https://doi.org/10.1162/evco_a_00357

Hyperparameter Control Using Fuzzy Logic: Evolving Policies for Adaptive Fuzzy Particle Swarm Optimization Algorithm

Nicolas Roy; Charlotte Beauthier; Alexandre Mayer

https://doi.org/10.1162/evco_a_00353

Analysis and simplification of the winner of the CEC 2022 optimization competition on single objective bound constrained search

Rafał Biedrzycki

https://doi.org/10.1162/evco.a.27

On stochastic operators, fitness landscapes, and optimization heuristics performances

Brahim Aboutaib; Sébastien Verel; Cyril Fonlupt; Bilel Derbel; Arnaud Liefooghe; Belaïd Ahiod

https://doi.org/10.1162/evco.a.24

Cross-Representation Genetic Programming: A Case Study on Tree-based and Linear Representations

Zhixing Huang; Yi Mei; Fangfang Zhang; Mengjie Zhang; Wolfgang Banzhaf

https://doi.org/10.1162/evco.a.25

Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling

Fangfang Zhang; Mazhar Ansari Ardeh; Yi Mei; Mengjie Zhang

https://doi.org/10.1162/evco.a.26

BlindSMOTE: Synthetic minority oversampling based only on evolutionary computation

Nicolás E. Garcí-Pedrajas; José M. Cuevas-Muñoz; Aida de Haro-García

https://doi.org/10.1162/evco_a_00374

On the Use of the Doubly Stochastic Matrix Models for the Quadratic Assignment Problem

Valentino Santucci; Josu Ceberio

https://doi.org/10.1162/evco_a_00369

P-NP Instance Decomposition Based on the Fourier Transform for Solving the Linear Ordering Problem

Xabier Benavides; Leticia Hernando; Josu Ceberio; Jose A. Lozano

https://doi.org/10.1162/evco_a_00368

BUSTLE: A Versatile Tool for the Evolutionary Learning of STL Specifications from Data

Federico Pigozzi; Laura Nenzi; Eric Medvet

https://doi.org/10.1162/evco_a_00347

Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms

Jun He; Yuren Zhou

https://doi.org/10.1162/evco_a_00349

OneMax Is Not the Easiest Function for Fitness Improvements

Marc Kaufmann; Maxime Larcher; Johannes Lengler; Xun Zou

https://doi.org/10.1162/evco_a_00348

Synthesising Diverse and Discriminatory Sets of Instances Using Novelty Search in Combinatorial Domains

Alejandro Marrero; Eduardo Segredo; Coromoto León; Emma Hart

https://doi.org/10.1162/evco_a_00350

A Layered Learning Approach to Scaling in Learning Classifier Systems for Boolean Problems

Isidro M. Alvarez; Trung B. Nguyen; Will N. Browne; Mengjie Zhang

https://doi.org/10.1162/evco_a_00351

1 2 3 4 5

CogNet

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

CogNet

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

This Feature Is Available To Subscribers Only