Related papers: Evolutionary algorithms for multi-center solutions

We describe the systematical construction of the first order formalism for multi-centered black holes with flat three dimensional base-space, within the so-called $T^{3}$ model of N=2, D=4 ungauged Maxwell-Einstein supergravity. The three…

Optimisation problems are ubiquitous in particle and astrophysics, and involve locating the optimum of a complicated function of many parameters that may be computationally expensive to evaluate. We describe a number of global optimisation…

Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms can produce good solutions to the 0-1 knapsack problem. Nonetheless, few rigorous investigations address the…

We discuss a general procedure to generate a class of (everywhere regular) solutions of Einstein equations that can have an (a-priori fixed) arbitrary number of horizons. We then report on work currently in progress i) to find a suitable…

The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for…

Machine Learning models incorporating multiple layered learning networks have been seen to provide effective models for various classification problems. The resulting optimization problem to solve for the optimal vector minimizing the…

Clustering is a fundamental problem in many areas, which aims to partition a given data set into groups based on some distance measure, such that the data points in the same group are similar while that in different groups are dissimilar.…

We construct and study stationary, asymptotically flat multicenter solutions describing regular black holes with non-Abelian hair (colored magnetic-monopole and dyon fields) in two models of $\mathcal{N}=2,d=4$ Super-Einstein-Yang-Mills…

Any spacetime containing a degenerate Killing horizon, such as an extremal black hole, possesses a well-defined notion of a near-horizon geometry. We review such near-horizon geometry solutions in a variety of dimensions and theories in a…

We consider the problem of optimizing a grey-box objective function, i.e., nested function composed of both black-box and white-box functions. A general formulation for such grey-box problems is given, which covers the existing grey-box…

We present techniques for long-term, stable, and accurate evolutions of multiple-black-hole spacetimes using the `moving puncture' approach with fourth- and eighth-order finite difference stencils. We use these techniques to explore…

Evolutionary computation offers a variety of tools to solve complex real-world optimization problems. However, research often focuses on smaller, simplified problems and optimization algorithms that sometimes miss expectations in real-world…

Using the entropy function formalism we compute the entropy of extremal supersymmetric and non-supersymmetric black holes in N=2 supergravity theories in four dimensions with higher derivative corrections. For supersymmetric black holes our…

This paper introduces a multi-level (m-lev) mechanism into Evolution Strategies (ESs) in order to address a class of global optimization problems that could benefit from fine discretization of their decision variables. Such problems arise…

Five-dimensional stringy rotating black holes are embedded into N=2 supergravity interacting with one vector multiplet. The existence of an unbroken supersymmetry of the rotating solution is proved directly by solving the Killing spinor…

We study spherically symmetric black hole solutions in a four-parameter Einstein-Cartan-type class of theories, called "torsion bigravity". These theories offer a geometric framework (with a metric and an independent torsionfull connection)…

This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems.It shows that such information can significantly enhance performance, but that the choice of…

A chain regularization method is combined with special purpose computer hardware to study the evolution of massive black hole binaries at the centers of galaxies. Preliminary results with up to N=260,000 particles are presented. The decay…

The surveillance multisensor placement is an important optimization problem that consists of positioning several sensors of different types to maximize the coverage of a determined area while minimizing the cost of the deployment. In this…

It has recently been shown that the uniqueness theorem for stationary black holes cannot be extended to five dimensions. However, uniqueness is an important assumption of the string theory black hole entropy calculations. This paper…