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 (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,911 Discovery Miles 29 110 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 (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,043 Discovery Miles 30 430 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...
Russell Hobbs Toaster (2 Slice…
R707 Discovery Miles 7 070
Rhodes And His Banker - Empire, Wealth…
Richard Steyn Paperback R330 R220 Discovery Miles 2 200
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Estee Lauder Beautiful Belle Eau De…
R2,241 R1,652 Discovery Miles 16 520
Sudocrem Skin & Baby Care Barrier Cream…
R70 Discovery Miles 700
Bostik Prestik (100g)
R25 Discovery Miles 250
Lucky Define - Plastic 3 Head…
R390 Discovery Miles 3 900
Hisense Combination Refrigerator (White)
R5,699 R4,199 Discovery Miles 41 990
Kendall Office Chair (Green)
 (1)
R1,699 R999 Discovery Miles 9 990

 

Partners