相关论文: Lane-formation vs. cluster-formation in two dimens…
We give evidence that particles interacting via the simple, radially symmetric square-shoulder potential can self-organize in highly complex, low-symmetry lattices, forming thereby clusters, columns, or lamellae; only at high pressure…
We present a method for reliably determining the lowest energy structure of an atomic cluster in an arbitrary model potential. The method is based on a genetic algorithm, which operates on a population of candidate structures to produce new…
We employ genetic algorithms (GA), which allow for an unbiased search for the global minimum of energy landscapes, to identify the ordered equilibrium configurations formed by binary dipolar systems confined on a plane. A large variety of…
The implementation of adaptive genetic algorithms (AGA) for optimization problems has proven to be superior than many other methods due to its nature of producing more robust and high quality solutions. Considering the complexity involved…
We present a genetic algorithm for the atomistic design and global optimisation of substitutionally disordered bulk materials and surfaces. Premature convergence which hamper conventional genetic algorithms due to problems with…
The concept of extended cloud requires efficient network infrastructure to support ecosystems reaching form the edge to the cloud(s). Standard approaches to network load balancing deliver static solutions that are insufficient for the…
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 developed (GA) to optimize molecular AF_6 cluster configurations with respect to their energy. The method is based on the Darvin's evolutionary theory: structures with lowest energies survive in a system of…
We compare Evolutionary Algorithms with Minima Hopping for global optimization in the field of cluster structure prediction. We introduce a new {\em average offspring} recombination operator and compare it with previously used operators.…
We present superconducting quantum circuits which exhibit atomic energy spectrum and selection rules as ladder and lambda three-level configurations designed by means of genetic algorithms. These heuristic optimization techniques are…
We discuss a novel genetic algorithm that can be used to find global minima on the potential energy surface of disordered ceramics and alloys using a real-space symmetry adapted crossover. Due to a high number of symmetrically equivalent…
We introduce genetic algorithms as a means to estimate the accuracy required to discriminate among different models using experimental observables. We exemplify the technique in the context of the minimal supersymmetric standard model. If…
This paper presents a genetic-based hybrid algorithm that combines the exploration power of Genetic Algorithm (GA) with the exploitation capacity of a phenotypical probabilistic local search algorithm. Though not limited to a certain class…
A new strategy for global geometry optimization of clusters is presented. Important features are a restriction of search space to favorable nearest-neighbor distance ranges, a suitable cluster growth representation with diminished…
In land surveying, the generation of maps was greatly simplified with the introduction of orthophotos and at a later stage with airborne LiDAR laser scanning systems. While the original purpose of LiDAR systems was to determine the altitude…
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…
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…
The potential benefit of migrating software design from Structured to Object Oriented Paradigm is manifolded including modularity, manageability and extendability. This design migration should be automated as it will reduce the time…
We propose an extended genetic algorithm (GA) with different local environmental conditions. Genetic entities, or configurations, are put on nodes in a ring structure, and location-dependent environmental conditions are applied for each…
A self-organizing approach is proposed for gene finding based on the model of codon usage for coding regions and positional preference for noncoding regions. The symmetry between the direct and reverse coding regions is adopted for reducing…