✦ LIBER ✦

Fast algorithm for optimal layer assignment

✍ Scribed by Y.S. Kuo; T.C. Chern; Wei-Kuan Shih

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 739 KB
Volume: 7
Category: Article
ISSN: 0167-9260
DOI: 10.1016/0167-9260(89)90003-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast annealing evolutionary algorithm

A fast annealing evolutionary algorithm for global optimization

✍ Wensheng Cai; Xueguang Shao 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast ann

A fast algorithm for a redundancy optimi

A fast algorithm for a redundancy optimization problem

✍ V.Dakshina Murty; K.B. Misra 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 400 KB

A Fast Algorithm for the Optimal Alignme

A Fast Algorithm for the Optimal Alignment of Three Strings

✍ Lloyd Allison 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg

An algorithm for fast optimal Latin hype

An algorithm for fast optimal Latin hypercube design of experiments

✍ Felipe A. C. Viana; Gerhard Venter; Vladimir Balabanov 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

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

A Fast Algorithm for Query Optimization

A Fast Algorithm for Query Optimization in Universal-Relation Databases

✍ Francesco Mario Malvestuto; Marina Moscarini 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 640 KB

The method of the canonical connection introduced by Maier and Ullman provides an optimal procedure for query processing in universal-relation databases. We present an algorithm for computing canonical connections in a database scheme which is more efficient than the classical algorithm based on tab