11 papers · ranked by Valyu relevance
Duc-Cuong Dang, Per Kristian Lehre
While some common fitness landscape characteristics are critical when determining the runtime of evolutionary algorithms (EAs), the relationship between fitness landscape structure and the runtime of EAs is poorly understood. Recently, Dang, Eremeev, and Lehre introduced a classification of pseudo-Boolean problems…
Tijn de Vos, Aleksander Christiansen
Tree-packings - collections of spanning trees of a graph - are a fundamental tool in the study of minimum cut and related graph parameters. They have played a central role in the design of algorithms across static, dynamic, and distributed settings. In this paper, we study both tree-packings themselves and their…
Emre Efendi, Berkan Dulek, Sinan Gezici, Yanglei Song + 5 more
In this review paper, we present a framework for the characterization of optimal decision rules in M-ary hypothesis-testing problems where the performance metric is defined as a function of pairwise error probabilities. This framework is based on the approaches developed in several recent studies in the literature…
Siyu Wang, Robert C. Wilson, Jean Daunizeau
Human decision making is inherently variable. While this variability is often seen as a sign of suboptimal behavior, both theoretical work in machine learning and empirical human studies suggest that variability can actually be adaptive. An example arises when we must choose between exploring unknown options or…
Mengqi Zhang, Guangqiang Teng, Xiaoyu Lei, Boris Ryabko
Lei proposed an algorithm Algorithm $A_{3}$ in 2023 to generate an exact discrete uniform distribution from an unknown biased Bernoulli source. The present paper does not claim a new extraction algorithm. Its contributions are analytical: first, we provide a Fourier-analytic proof of the uniformity mechanism based on…
Ulrich Schmid, Stephan Felber, Hugo Rincon Galeana
We provide a complete characterization of the solvability/impossibility of deterministic stabilizing consensus in virtually any computing model with benign process and communication faults using point-set topology. Relying on the topologies for infinite executions introduced by Nowak, Schmid and Winkler (JACM, 2024)…
Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer
We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek}…
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
We study countably infinite Markov decision processes with Büchi objectives, which ask to visit a given subset of states infinitely often. A question left open by T.P. Hill ([10]) is whether there always exist $\varepsilon$-optimal Markov strategies, i.e., strategies that base decisions only on the current state and on…
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
We settle the parameterized complexities of several variants of independent set reconfiguration and dominating set reconfiguration, parameterized by the number of tokens. We show that both problems are XL-complete when there is no limit on the number of moves, XNL-complete when a maximum length $\ell$ for the sequence…
Joan Marcè i Igual, Marc Geilen, Mitra Nasri, Twan Basten
Optimising productivity of tightly coupled production lines in, for instance, the production printing or semiconductor industry is difficult due to the diversity of products resulting in different product flows, the variety of constraints, and the precise timing required to coordinate multiple tightly coupled machines.…
Zhong Yu, Yupeng Liu
Microbial interaction has been widely acknowledged as the deterministic factor for microbiota assembly. However, in the microbial environment, such interactions are highly variable and may lead to the random birth, death, and reproduction of neighboring microbes, potentially contributing to stochastic assembly…