๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Annealing Algorithm for Searching Optimal Block Designs

โœ Scribed by J. Jansen; R. C. M. H. Douven; E. E. M. van Berkum

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
467 KB
Volume
34
Category
Article
ISSN
0323-3847

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Searching for Optimal Block Designs when
Searching for Optimal Block Designs when Block Effects are Random
โœ Dr. B. Jones ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 394 KB

A n algorithm that seercbw for optimal block designs when block effecta are random is deecribed. Some eituatione in which eucb an algorithm will prove ueeful are coneidered. An illuetrative example and mme discurnion are given.

An optimal algorithm for layered wheel f
An optimal algorithm for layered wheel floorplan designs
โœ Kulasinghe, Priyalal D.; Bettayeb, Sa๏ฟฝd ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 83 KB ๐Ÿ‘ 2 views

In this paper, we present an efficient algorithm to solve the orientation optimization problem for a layered wheel floorplan. The strategy used is to generate all the nonredundant implementations for the floorplan. The computational complexities of the algorithm depend on the actual dimensions of th

Simulated Annealing and Genetic Algorith
Simulated Annealing and Genetic Algorithms for Optimal Regression Testing
โœ Mansour, Nashat; El-Fakih, Khalid ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 2 views

The optimal regression testing problem is one of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. We present two natural optimization algorithms, namely, a simulated annealing and a genetic algorithm, for solving this problem. The algor

An optimal migration algorithm for dynam
An optimal migration algorithm for dynamic load balancing
โœ HU, Y. F.; BLAKE, R. J.; EMERSON, D. R. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 207 KB ๐Ÿ‘ 1 views

The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The relationship between this algorithm and some existing algorithms is discussed and the convergence of the new