Search Results

The recombination operator plays an important role in many evolutionary algorithms. However, in Cartesian Genetic Programming (CGP), which is part of the aforementioned category, the usefulness of crossover is contested. In this work, we ...

Lexically constrained text generation aims to generate text by indicated keywords. Previous work has employed non-autoregressive insertion methods which iteratively insert tokens between keywords to generate complete sentences. However, the ...

Evolutionary algorithms are popular algorithms for multi-objective optimisation (also called Pareto optimisation) as they use a population to store trade-offs between different objectives. Despite their popularity, the theoretical foundation of ...

In the United States, regions (such as states or counties) are frequently divided into districts for the purpose of electing representatives. How the districts are drawn can have a profound effect on who is elected, and drawing the districts to ...

In the U.S., states redraw electoral district boundaries every ten years. Given that redistricting affects political representation at both the state and national levels, it is crucial to prevent the manipulation of district boundaries ...

• Local search for redistricting is examined following the introduction of ReCom.

A simple Voting algorithm has been shown to be effective at solving the OneMax problem in the presence of high levels of posterior noise in our previous research. In this paper, we extend this analysis to several different noise models,...

Surrogate model based Evolution Strategies (like the doubly trained surrogate model CMA-ES, DTS-CMA-ES) use a model of the objective function to reduce the number of function evaluations during optimization. This work investigates to use the ...

Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph G. A partition of V ( G ) is connected if every part induces a connected subgraph. In many ...

• A novel depth map super-resolution network that adopts a progressive depth reconstruction approach is proposed.

Low spatial resolution is a common problem for depth maps captured by low-cost consumer depth cameras. Depth map super-resolution (DMSR) can improve the quality of depth maps, but it is an ill-posed problem with many challenges. This ...

Neuroevolution has re-emerged as an active topic in the last few years. However, there is a lack of accessible tools to analyse, contrast and visualise the behaviour of neuroevolution systems. A variety of search strategies have been proposed such ...

Positional Burrows-Wheeler Transform (PBWT) is a data structure that supports efficient algorithms for finding matching segments in a panel of haplotypes. It is of interest to study the composite patterns of multiple matching segments or blocks ...

This paper aims to discuss extensively the system of relationships among several types of art and branches of science, under a political perspective discarding any theological/capitalist stance. Once established a quasi-equivalence between creativity and ...

The lockdown response taken by many governments in flattening the curve of coronavirus infections has of course increased the reliance on digital tools to enable work (for those able to do so) and social interaction. There are emergent, somewhat ...

A theoretical model for GaAs-based solar cells with PIN structure is proposed herein. The effect of varying key parameters on the conversion efficiency is investigated. The simulations are performed using COMSOL Multiphysics software. The ...

It is generally accepted that populations are useful for the global exploration of multi-modal optimisation problems. Indeed, several theoretical results are available showing such advantages over single-trajectory search heuristics. In this paper ...$\mathrm{}$$\left(\sqrt{}\right)$

In the paper ‘A probabilistic analysis of a discrete-time evolution in recombination’ [4] the evolution of the recombination transformation Ξ = ∑ δ ρ δ ⨂ J ∈ δ μ J was described by a Markov chain ( Y n ) on a set of partitions, which ...

In this article, the new crossover operator BBX for Evolutionary Algorithms (EAs) for traveling salesman problems (TSPs) is introduced. It uses branch-and-bound to find the optimal combination of the (directed) edges present in the parent solutions. ...

At the chromosomal level of evolution, recombination is a major factor for genetic variations. However, recombination does not occur with equal frequency at various regions of genome. The recombination has the tendency to occur at specific region with ...

Stochastic models and simulation algorithms for spatially separated reactants in the vicinity of traps were developed. The methods were applied to simulate electron---hole recombination in inhomogeneous semiconductors. Continuous kinetic Monte Carlo ...

A new indirect quadrangular mesh generation algorithm which relies on sequential decision-making techniques to search for optimal triangle recombinations is presented. In contrast to the state-of-art Blossom-quad algorithm, this new algorithm is a good ...