𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Constructions of Hybrid Algorithms

✍ Scribed by Ming-Yang Kao; Yuan Ma; Michael Sipser; Yiqun Yin


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
288 KB
Volume
29
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Constructions of optimal packing designs
✍ Jianxing Yin; Ahmed M. Assaf πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number

Constructions of optimal variable-weight
✍ Hengming Zhao; Dianhua Wu; Pingzhi Fan πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract Variable‐weight optical orthogonal code (OOC) was introduced by G‐C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this article, new infinite classes of optimal (__u, W__, 1, {1/2, 1/2})‐OOCs are obtained for __W__={3, 4}, {3, 5} and {3,

A hybrid genetic/optimization algorithm
✍ Atidel Ben Hadj-Alouane; James C. Bean; Katta G. Murty πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 117 KB πŸ‘ 2 views

We consider the problem of designing a distributed computing system for handling a set of repetitive tasks on a periodic basis. Tasks assigned to di!erent processors need communication link capacity, tasks executing on the same processor do not. The aim is to develop a design of minimum total cost t