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

How to test a tree

โœ Scribed by Kahng, Andrew B.; Robins, Gabriel; Walkup, Elizabeth A.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
207 KB
Volume
32
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

We address the problem of verifying that a tree is connected using probe operations which check mutual connectivity between two (or more) leaves of the tree. We present optimal algorithms for determining minimal probe sets that detect all possible edge and vertex faults in arbitrary trees. Our results are of particular interest for the testing of interconnection substrates in VLSI multichip module packaging technologies.

๐Ÿ“œ SIMILAR VOLUMES

How to grow a family tree
How to grow a family tree
โœ Eliza Henry-Jones ๐Ÿ“‚ Fiction ๐Ÿ“… 2020 ๐Ÿ› HarperCollins - AU; Angus & Robertson ๐ŸŒ English โš– 191 KB ๐Ÿ‘ 3 views

**From the author*of P is for Pearl*comes a heart-warming book about family, friendship and what home can mean.** Stella may only be seventeen, but having read every self-help book she can find means she knows a thing or two about helping people. She sure wasn't expecting to be the one in need

How to Grow a Family Tree
How to Grow a Family Tree
โœ Eliza Henry Jones ๐Ÿ“‚ Fiction ๐Ÿ“… 2020 ๐Ÿ› HarperCollinsPublishers ๐ŸŒ English โš– 191 KB ๐Ÿ‘ 2 views
How to Pack Trees
How to Pack Trees
โœ Joseph Gil; Alon Itai ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

In a virtual memory system, the address space is partitioned into pages, and the main memory serves as a cache to the disk. In this setting, we address the following problem: Given a tree, find an allocation of its nodes to pages, so-called a packing, which optimizes the cache performance for some a

How to Appraise a Diagnostic Test
How to Appraise a Diagnostic Test
โœ Mohit Bhandari; Gordon H. Guyatt ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English โš– 151 KB