𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Bounds on the Size of Optimal Meshes

✍ Scribed by Donald R. Sheehy

Book ID
117950533
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
761 KB
Volume
31
Category
Article
ISSN
0167-7055

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimal Adaptive Routing on the Mesh wit
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
✍ Donald D. Chinn; Tom Leighton; Martin Tompa πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 388 KB

An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around ''hot spots.'' Minimal adaptive routing algorithms have the additional a

New upper bounds on the minimum size of
New upper bounds on the minimum size of covering designs
✍ Iliya Bluskov; Heikki HΓ€mΓ€lΓ€inen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size