Related papers: Genetic algorithms predict formation of exotic ord…
A genetic algorithm (GA) is a search-based optimization technique based on the principles of Genetics and Natural Selection. We present an algorithm which enhances the classical GA with input from quantum annealers. As in a classical GA,…
Genetic algorithms are a class of heuristic search techniques that apply basic evolutionary operators in a computational setting. We have designed a fully parallel and distributed hardware/software implementation of the generalized…
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…
In this work we use genetic algorithm to search for the gravitational wave signal from the inspiralling massive Black Hole binaries in the simulated LISA data. We consider a single signal in the Gaussian instrumental noise. This is a first…
Discrete mixture models provide a well-known basis for effective clustering algorithms, although technical challenges have limited their scope. In the context of gene-expression data analysis, a model is presented that mixes over a finite…
In this work, we show how a genetic algorithm (GA) can be used to find step-by-step solutions to introductory physics problems. Our perspective is that the underlying task for this is one of finding a sequence of equations that will lead to…
We present a genetic algorithm (GA)-based inverse design framework for synthesizing high-performance planar terahertz (THz) filters integrated with coplanar striplines (CPSs). The method efficiently explores high-dimensional design spaces…
The computational models for geophysical flows are computationally very expensive to employ in multi-query tasks such as data assimilation, uncertainty quantification, and hence surrogate models sought to alleviate the computational burden…
Recent studies of the self-assembly of Langmuir monolayers have revealed novel forms of lateral molecular ordering. Such studies typically involve the use of grazing-incidence synchrotron radiation scattering, and the lateral order…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
Application of Genetic Algorithm (GA) for determination of parameters of an analytical representation of diatomic molecule potential is presented. GA can be used for finding potential characteristics of an electronic energy state which can…
Genetic Algorithms (GAs) are explored as a tool for probing new physics with high dimensionality. We study the 19-dimensional pMSSM, including experimental constraints from all sources and assessing the consistency of potential signals of…
A novel Genetic Algorithm is described that is suitable for determining the global minimum energy configurations of crystal structures and which can also be used as a polymorph search technique. This algorithm requires no prior assumptions…
We investigate the effect of dipolar interactions in one-dimensional systems in connection with the possibility of observing exotic many-body effects with trapped atomic and molecular dipolar gases. By combining analytical and numerical…
Protein structure prediction can be shown to be an NP-hard problem; the number of conformations grows exponentially with the number of residues. The native conformations of proteins occupy a very small subset of these, hence an exploratory,…
We present a genetic algorithm (GA) for structural search that combines the speed of structure exploration by classical potentials with the accuracy of density functional theory (DFT) calculations in an adaptive and iterative way. This…
Autonomous materials discovery with desired properties is one of the ultimate goals for materials science, and the current studies have been focusing mostly on high-throughput screening based on density functional theory calculations and…
We return to the geometry optimization problem of Lennard-Jones clusters to analyze the performance dependence of "cut and splice" genetic algorithms (GAs) on the employed population size. We generally find that admixing twinning mutation…
This paper presented a genetic algorithm (GA) to solve the container storage problem in the port. This problem is studied with different container types such as regular, open side, open top, tank, empty and refrigerated containers. The…
A genetic algorithm procedure is demonstrated that refines the selection of interpolation points of the discrete empirical interpolation method (DEIM) when used for constructing reduced order models for time dependent and/or parametrized…