Using simulated annealing to design good codes

AE Gamal, L Hemachandra… - IEEE Transactions on …, 1987 - ieeexplore.ieee.org
Simulated annealing is a computational heuristic for obtaining approximate solutions to
combinatorial optimization problems. It is used to construct good source codes, error …

[图书][B] Frameworks, tensegrities, and symmetry

R Connelly, SD Guest - 2022 - books.google.com
This introduction to the theory of rigid structures explains how to analyze the performance of
built and natural structures under loads, paying special attention to the role of geometry. The …

Iterated dynamic neighborhood search for packing equal circles on a sphere

X Lai, D Yue, JK Hao, F Glover, Z Lü - Computers & Operations Research, 2023 - Elsevier
In this work, we investigate the equal circle packing problem on a sphere (ECPOS), which
consists in packing N equal non-overlapping circles on a unit sphere such that the radius of …

Candidate atomic cluster configurations in metallic glass structures

DB Miracle, EA Lord, S Ranganathan - Materials transactions, 2006 - jstage.jst.go.jp
It has long been suggested that atomic clusters may provide representative structural
elements in metallic glasses. The dense random packing model described atomic clusters …

[PDF][PDF] Distributing points on the sphere: partitions, separation, quadrature and energy.

PC Leopardi - 2007 - academia.edu
Distributing points on the sphere: Page 1 The University of New South Wales School of
Mathematics and Statistics Department of Applied Mathematics Distributing points on the …

The optimal packing of circles on a sphere

BW Clare, DL Kepert - Journal of mathematical chemistry, 1991 - Springer
The closest packing of x circles on the surface of a sphere is calculated in the same way that
the stereochemical arrangement of atoms around a central atom is determined. A number of …

Multi-symmetric close packings of equal spheres on the spherical surface

T Tarnai, Z Gáspár - Acta Crystallographica Section A: Foundations …, 1987 - journals.iucr.org
An analysis is presented for the Tammes problem: how must n points be distributed on the
surface of a sphere in order that the minimum angular distance between any two of the …

Configuration spaces of equal spheres touching a given sphere: the twelve spheres problem

R Kusner, W Kusner, JC Lagarias… - New trends in intuitive …, 2018 - Springer
The problem of twelve spheres is to understand, as a function of r ∈ (0, r_ max (12), the
configuration space of 12 non-overlapping equal spheres of radius r touching a central unit …

[图书][B] Arrangements of points on the sphere

Y Zhou - 1995 - search.proquest.com
In this dissertation, we investigate the energy of arrangements of N points on the surface of
the unit sphere in R $\sp3 $, interacting through a power law potential $ V (r)= r\sp\alpha …

Covering a sphere by equal circles, and the rigidity of its graph

T Tarnai, Z Gáspár - Mathematical Proceedings of the Cambridge …, 1991 - cambridge.org
How must a sphere be covered by n equal circles so that the angular radius of the circles will
be as small as possible? In this paper, conjectured solutions of this problem for n= 15 to 20 …