Sciweavers

6833 search results - page 221 / 1367
» Some two-character sets
Sort
View
VTS
1997
IEEE
96views Hardware» more  VTS 1997»
15 years 10 months ago
Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors
Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a sm...
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. P...
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 10 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
ICCD
1994
IEEE
85views Hardware» more  ICCD 1994»
15 years 10 months ago
A Superassociative Tagged Cache Coherence Directory
Dynamically tagged directories are memory-efficient mechanisms for maintaining cache coherence in sharedmemory multiprocessors. These directories use specialpurpose caches of poin...
David J. Lilja, Shanthi Ambalavanan
180
Voted
DAC
1994
ACM
15 years 10 months ago
Permissible Observability Relations in FSM Networks
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
Huey-Yih Wang, Robert K. Brayton
IMPERIAL
1993
15 years 10 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan