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...
Snappy Tritan Bottle (1.5L)(Green)
R229 R180 Discovery Miles 1 800
Tommy Hilfiger - Tommy Cologne Spray…
R1,218 R694 Discovery Miles 6 940
A Seed Of A Dream - Morris Isaacson High…
Clive Glaser Paperback R265 R195 Discovery Miles 1 950
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Bestway Beach Ball (51cm)
 (2)
R26 Discovery Miles 260
Shield Fresh 24 Mist Spray (Vanilla…
R19 Discovery Miles 190
Faber-Castell Minibox 1 Hole Sharpener…
R10 Discovery Miles 100
Cadac Jet No 21 For Cadac Cooker (2…
R54 Discovery Miles 540
Aerolatte Cappuccino Art Stencils (Set…
R110 R95 Discovery Miles 950

 

Partners