Explaining to what extent the real power of genetic algorithms (GAs) lies in the ability of
crossover to recombine individuals into higher quality solutions is an important problem in …

A predominant topic in the theory of evolutionary algorithms and, more generally, theory of
randomized black-box optimization techniques is running-time analysis. Running-time …

Excessive reuse of holdout data can lead to overfitting. However, there is little concrete
evidence of significant overfitting due to holdout reuse in popular multiclass benchmarks …

In the Generalized Mastermind problem, there is an unknown subset $ H $ of the hypercube
$\{0, 1\}^ d $ containing $ n $ points. The goal is to learn $ H $ by making a few queries to an …

We study the query complexity of determining a hidden permutation. More specifically, we
study the problem of learning a secret (z, π) consisting of a binary string z of length n and a …

We study the query complexity of a permutation-based variant of the guessing game
Mastermind. In this variant, the secret is a pair (z, π) which consists of a binary string z∈{0 …

Mastermind with a linear number of queries Page 1 Combinatorics, Probability and Computing
(2023), 1–14 doi:10.1017/S0963548323000366 ARTICLE Mastermind with a linear number of …

In this paper 1 we introduce a variant of Mastermind, which we call Static Permutation
Mastermind and which is defined as follows. One player creates a secret code, called secret …

This contribution focuses on the challenge of formulating a set of benchmark problems
and/or a test-suite for Combinatorial Optimization problems when treated as black-box …

Mastermind is a two players zero sum game of imperfect information. Starting with Erdős and
Rényi (1963), its combinatorics have been studied to date by several authors, eg, Knuth …