Minimum fault coverage in memory arrays: A fast algorithm and probabilistic analysis
10.1109/43.503937
Saved in:
Main Authors: | Low, C.-P., Leong, H.W. |
---|---|
Other Authors: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/99336 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A new class of efficient algorithms for reconfiguration of memory arrays
by: Low, C.P., et al.
Published: (2014) -
Complete multi-robot coverage of unknown environments with minimum repeated coverage
by: Ge, S.S., et al.
Published: (2014) -
Design and analysis of phased antenna array with low sidelobe by fast algorithm
by: Yuan, T., et al.
Published: (2014) -
k-Center Problems with Minimum Coverage
by: LIM, Andrew, et al.
Published: (2005) -
k-Center problems with minimum coverage
by: Rodrigues, Brian, et al.
Published: (2004)