0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Fault Covering Problems in Reconfigurable VLSI Systems (Hardcover, 1992 ed.): Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason... Fault Covering Problems in Reconfigurable VLSI Systems (Hardcover, 1992 ed.)
Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong, Philip McKinley, C.L. Liu
R3,104 Discovery Miles 31 040 Ships in 10 - 15 working days

Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems. Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems. The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems. The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.

Fault Covering Problems in Reconfigurable VLSI Systems (Paperback, Softcover reprint of the original 1st ed. 1992): Ran... Fault Covering Problems in Reconfigurable VLSI Systems (Paperback, Softcover reprint of the original 1st ed. 1992)
Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong, Philip McKinley, C.L. Liu
R2,975 Discovery Miles 29 750 Ships in 10 - 15 working days

Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems. Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems. The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems. The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
The Bassanos - Venetian Musicians and…
Roger Prior Hardcover R4,582 Discovery Miles 45 820
An Historical Map of Kingston Upon Hull
David Neave, Susan Neave Sheet map, folded R303 R281 Discovery Miles 2 810
CCNP Enterprise Certification Study…
B Piper Paperback R1,486 R1,176 Discovery Miles 11 760
Copper Electrodeposition for…
Kazuo Kondo, Rohan N. Akolkar, … Hardcover R3,052 Discovery Miles 30 520
The Keyboard Music of J.S. Bach
David Schulenberg Hardcover R4,614 Discovery Miles 46 140
The Modern Arabic Short Story…
M. Shaheen Hardcover R1,579 Discovery Miles 15 790
Closing The Gap - The Fourth Industrial…
Tshilidzi Marwala Paperback R240 R218 Discovery Miles 2 180
White Chalk - Stories
Terry-Ann Adams Paperback  (1)
R220 R198 Discovery Miles 1 980
Not Just Chatting - How to Become a…
Nicole Christina Hardcover R443 Discovery Miles 4 430
The Handbook of Disgust Research…
Philip A. Powell, Nathan S. Consedine Hardcover R4,330 Discovery Miles 43 300

 

Partners