𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding global minima with a new dynamical evolutionary algorithm

✍ Scribed by Zou Xiu-fen; Kang Li-shan; Li Yuan-xiang; Chen Yu-ping

Publisher
Wuhan University
Year
2002
Tongue
English
Weight
298 KB
Volume
7
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Global cluster geometry optimization by
Global cluster geometry optimization by a phenotype algorithm with Niches: Location of elusive minima, and low-order scaling with cluster size
✍ Hartke, Bernd πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 2 views

The problem of global geometry optimization of clusters is addressed with a phenotype variant of the method of genetic algorithms, with several novel performance enhancements. The resulting algorithm is applied to Lennard-Jones clusters as benchmark system, with up to 150 atoms. The well-known, diff

A new heuristic algorithm for finding mi
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
✍ Anna HaΔ‡; Kelei Zhou πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn