Zobrazeno 1 - 10
of 298
pro vyhledávání: '"Rudolph, Günter"'
Randomized search heuristics have been applied successfully to a plethora of problems. This success is complemented by a large body of theoretical results. Unfortunately, the vast majority of these results regard problems with binary or continuous de
Externí odkaz:
http://arxiv.org/abs/2412.11684
Autor:
Neumann, Frank, Rudolph, Günter
Constrained submodular optimization problems play a key role in the area of combinatorial optimization as they capture many NP-hard optimization problems. So far, Pareto optimization approaches using multi-objective formulations have been shown to be
Externí odkaz:
http://arxiv.org/abs/2406.13414
Autor:
Neumann, Joshua
Publikováno v:
Music & Letters, 2018 Aug 01. 99(3), 502-504.
Externí odkaz:
https://www.jstor.org/stable/48561266
We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary m
Externí odkaz:
http://arxiv.org/abs/2005.13865
Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a new kernel
Externí odkaz:
http://arxiv.org/abs/1807.03555
In this paper, we propose a novel approach (SAPEO) to support the survival selection process in multi-objective evolutionary algorithms with surrogate models - it dynamically chooses individuals to evaluate exactly based on the model uncertainty and
Externí odkaz:
http://arxiv.org/abs/1611.00260
Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on costly playtes
Externí odkaz:
http://arxiv.org/abs/1603.03795
In the a posteriori approach of multiobjective optimization the Pareto front is approximated by a finite set of solutions in the objective space. The quality of the approximation can be measured by different indicators that take into account the appr
Externí odkaz:
http://arxiv.org/abs/1503.07845