✦ LIBER ✦

Dynamic lattice searching methods for optimization of clusters

✍ Scribed by Xueguang Shao; Xia Wu; Wensheng Cai

Publisher: Higher Education Press and Springer
Year: 2009
Tongue: English
Weight: 341 KB
Volume: 4
Category: Article
ISSN: 1673-3495
DOI: 10.1007/s11458-009-0104-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic lattice searching method for f

A dynamic lattice searching method for fast optimization of Lennard–Jones clusters

✍ Xueguang Shao; Longjiu Cheng; Wensheng Cai 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract A highly efficient unbiased global optimization method called dynamic lattice searching (DLS) was proposed. The method starts with a randomly generated local minimum, and finds better solution by a circulation of construction and searching of the dynamic lattice (DL) until the better so

A dynamic lattice searching method with

A dynamic lattice searching method with constructed core for optimization of large lennard-jones clusters

✍ Xiaoli Yang; Wensheng Cai; Xueguang Shao 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract A variation of the previous dynamic lattice searching (DLS) method, named as DLS with constructed core (DLSc), was proposed for structural optimization of Lennard‐Jones (LJ) clusters. In the new method, the starting random structure is generated with an icosahedron or a decahedron as a

A dynamic lattice searching method with

A dynamic lattice searching method with interior operation for unbiased optimization of large Lennard-Jones clusters

✍ Xueguang Shao; Xiaoli Yang; Wensheng Cai 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract For improving the efficiency of dynamic lattice searching (DLS) method for unbiased optimization of large Lennard‐Jones (LJ) clusters, a variant of the interior operation (IO) proposed by Takeuchi was combined with DLS. The method is named as DLS‐IO. In the method, the IO moves outer at

Geometry Optimization and Conformational

Geometry Optimization and Conformational Analysis of (C60)N Clusters Using a Dynamic Lattice-Searching Method

✍ Longjiu Cheng; Wensheng Cai; Xueguang Shao 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 2 views

Optimization methods for fuzzy clusterin

Optimization methods for fuzzy clustering

✍ Fu Guoyao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 470 KB

As known, the clustering data obtained by the paired comparisons or questionnaires are symmetric and can be represented by a fuzzy symmetric and reflexive matrix B which is called to a fuzzy similarity matrix in this paper. In general, they do not necessarily satisfy the fuzzy transitive condition w

Discrete search methods for optimizing s

Discrete search methods for optimizing stochastic systems

✍ Mohamed A. Ahmed; Talal M. Alkhamis; Douglas R. Miller 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 364 KB

AbstractÐIn simulation practice, although estimating the performance of a complex stochastic system is of great value to the decision maker, it is not always enough. For example, a warehouse manager may be interested in ®nding out the probability that all demands are met from on-hand inventory under