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. |
---|---|
其他作者: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
格式: | Article |
出版: |
2014
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/99336 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
A new class of efficient algorithms for reconfiguration of memory arrays
由: Low, C.P., et al.
出版: (2014) -
Design and analysis of phased antenna array with low sidelobe by fast algorithm
由: Yuan, T., et al.
出版: (2014) -
Complete multi-robot coverage of unknown environments with minimum repeated coverage
由: Ge, S.S., et al.
出版: (2014) -
k-Center Problems with Minimum Coverage
由: LIM, Andrew, et al.
出版: (2005) -
k-Center problems with minimum coverage
由: Rodrigues, Brian, et al.
出版: (2004)