Referenced Items are not available for this document.
In this paper, we present a new class of linear time heuristic algorithms for reconfiguring RRAMs. One novel feature of our algorithms is that we are able to derive new bounds on the fault counts for fast detection of reparable and irreparable RRAMs. Another novel feature is that, based on our algorithms, we are able to identify a new polynomial time solvable instance of the reconfiguration problem. Empirical results indicate that our new class of algorithms is indeed fast and effective
Published in:
Computers, IEEE Transactions on
(Volume:45
,
Issue:
5
)
Date of Publication: May 1996
- Page(s):
- 614 - 618
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 5294015
- Digital Object Identifier :
- 10.1109/12.509914
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1996
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
