ﻻ يوجد ملخص باللغة العربية
Optimally selecting a subset of targets from a larger catalog is a common problem in astronomy and cosmology. A specific example is the selection of targets from an imaging survey for multi-object spectrographic follow-up. We present a new heuristic algorithm, HYBRID, for this purpose and undertake detailed studies of its performance. HYBRID combines elements of the simulated annealing, MCMC and particle-swarm methods and is particularly successful in cases where the survey landscape has multiple curvature or clustering scales. HYBRID consistently outperforms the other methods, especially in high-dimensionality spaces with many extrema. This means many fewer simulations must be run to reach a given performance confidence level and implies very significant advantages in solving complex or computationally expensive optimisation problems.
Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state.
In the small phylogeny problem we, are given a phylogenetic tree and gene orders of the extant species and our goal is to reconstruct all of the ancestral genomes so that the number of evolutionary operations is minimized. Algorithms for reconstructi
We point out that in theories where the gravitino mass, $M_{3/2}$, is in the range (10-50)TeV, with soft-breaking scalar masses and trilinear couplings of the same order, there exists a robust region of parameter space where the conditions for electr
Given the Thomas-Fermi equation sqrt(x)phi=phi*(3/2), this paper changes first the dependent variable by defining y(x)=sqrt(x phi(x)). The boundary conditions require that y(x) must vanish at the origin as sqrt(x), whereas it has a fall-off behaviour
We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimise the sum of the first Dirichlet Laplace--Beltrami operator eigenvalues over a given number of partitions of a surface. We consider a method