Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,71
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,25
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
Publicado por Springer, Berlin, Springer International Publishing, Springer, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 56,98
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 53,76
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 65,34
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,85
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 60,23
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 78,67
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 128.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 77,11
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 130 pages. 9.50x6.50x0.75 inches. In Stock.
Publicado por Springer International Publishing, Springer International Publishing Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware -This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 128 pp. Englisch.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 81,30
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 130.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,23
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,57
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 107,88
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 98,40
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 48,55
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 128,65
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Springer International Publishing Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science. 128 pp. Englisch.
Publicado por Berlin Springer International Publishing Springer Okt 2016, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science. 113 pp. Englisch.
Publicado por Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,37
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explains why SAT-solvers are efficient on certain classes of CSPsExplains which SAT encodings preserve tractability of certain classes of CSPsValuable for researchers and graduate students in artificial intelligence and theoretical comp.
Publicado por Springer International Publishing, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,74
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explains why SAT-solvers are efficient on certain classes of CSPsExplains which SAT encodings preserve tractability of certain classes of CSPsValuable for researchers and graduate students in artificial intelligence and theoretical comp.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 79,59
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 128.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 81,95
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 130.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 83,45
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 128.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 85,00
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 130.