Condizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 51,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 56,71
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 55,99
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 57,86
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. pp. 128 Softcover reprint of the original 1st ed. 2015 edition NO-PA16APR2015-KAP.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 64,49
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer, Berlin, Springer International Publishing, Springer, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 57,68
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: preigu, Osnabrück, Germania
EUR 49,75
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Bridging Constraint Satisfaction and Boolean Satisfiability | Justyna Petke | Taschenbuch | Previously published in hardcover | xi | Englisch | 2016 | Springer | EAN 9783319373645 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Lingua: Inglese
Editore: Berlin Springer International Publishing Springer Okt 2016, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Majestic Books, Hounslow, Regno Unito
EUR 70,19
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 128.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 73,20
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 128.
Lingua: Inglese
Editore: Springer International Publishing, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Da: moluna, Greven, Germania
EUR 48,74
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.