Zobrazeno 1 - 10
of 248
pro vyhledávání: '"Witt, Carsten"'
Autor:
Neumann, Frank, Witt, Carsten
Constrained single-objective problems have been frequently tackled by evolutionary multi-objective algorithms where the constraint is relaxed into an additional objective. Recently, it has been shown that Pareto optimization approaches using bi-objec
Externí odkaz:
http://arxiv.org/abs/2406.04899
Autor:
Adak, Sumit, Witt, Carsten
A class of metaheuristic techniques called estimation-of-distribution algorithms (EDAs) are employed in optimization as more sophisticated substitutes for traditional strategies like evolutionary algorithms. EDAs generally drive the search for the op
Externí odkaz:
http://arxiv.org/abs/2404.11239
Autor:
Krejca, Martin S., Witt, Carsten
We propose a new, flexible approach for dynamically maintaining successful mutation rates in evolutionary algorithms using $k$-bit flip mutations. The algorithm adds successful mutation rates to an archive of promising rates that are favored in subse
Externí odkaz:
http://arxiv.org/abs/2404.04015
Publikováno v:
FOGA 23, 2023, 61-72
We consider a simple setting in neuroevolution where an evolutionary algorithm optimizes the weights and activation functions of a simple artificial neural network. We then define simple example functions to be learned by the network and conduct rigo
Externí odkaz:
http://arxiv.org/abs/2307.00799
Autor:
Neumann, Frank, Witt, Carsten
Pareto optimization using evolutionary multi-objective algorithms has been widely applied to solve constrained submodular optimization problems. A crucial factor determining the runtime of the used evolutionary algorithms to obtain good approximation
Externí odkaz:
http://arxiv.org/abs/2305.07178
The Metropolis algorithm (MA) is a classic stochastic local search heuristic. It avoids getting stuck in local optima by occasionally accepting inferior solutions. To better and in a rigorous manner understand this ability, we conduct a mathematical
Externí odkaz:
http://arxiv.org/abs/2304.10848
Autor:
Neumann, Frank, Witt, Carsten
Evolutionary multi-objective algorithms have successfully been used in the context of Pareto optimization where a given constraint is relaxed into an additional objective. In this paper, we explore the use of 3-objective formulations for problems wit
Externí odkaz:
http://arxiv.org/abs/2304.08774
Autor:
Neumann, Frank, Witt, Carsten
Linear functions play a key role in the runtime analysis of evolutionary algorithms and studies have provided a wide range of new insights and techniques for analyzing evolutionary computation methods. Motivated by studies on separable functions and
Externí odkaz:
http://arxiv.org/abs/2208.05670
The compact genetic algorithm (cGA) is an non-elitist estimation of distribution algorithm which has shown to be able to deal with difficult multimodal fitness landscapes that are hard to solve by elitist algorithms. In this paper, we investigate the
Externí odkaz:
http://arxiv.org/abs/2204.04904
Publikováno v:
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. Algorithmica. 2023
We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial time. This result was conjectured by Wegener (2005). More precisely, d
Externí odkaz:
http://arxiv.org/abs/2204.02097