Cope intractable problem using de sensarma debajit (3 resultados)
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 36,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. How to cope with an Intractable Problem | using Binary Decision Diagram | Debajit Sensarma (u. a.) | Taschenbuch | 72 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659437397 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at…]preigu[dot]de | Anbieter: preigu.
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 103,82
Envío por EUR 28,97Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 39,90
Envío por EUR 60,63Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Two-level logic minimization is an attractive topic in the active research domain and it is a central problem in logic synthesis, as well as in reliability analysis and automated reasoning and other real life applications. But, this Two-…level logic minimization problem involves computationally intractable problems and many heuristic approaches have been developed to cope with this problem. This book contains the work which deals with the Two-level logic minimization problem using a popular data structure called Binary Decision Diagram (BDD) which is an important family of data structures that have rapidly become the method of choice for representing and manipulating Boolean Functions inside a computer. Also the implicit set manipulation techniques based on BDD could be used with success to compute the sets of Prime and Essential Prime Implicants of Boolean Functions for which these sets are too large to be explicitly built. So, this feature of BDD, the proper variable ordering of the BDD, Reduced Ordered BDD and other heuristic methods are used in this work for solving the Two-level logic minimization problem for the functions which generates large set of Prime Implicants.
