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
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
## 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,
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