Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 53,65
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
EUR 44,54
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 59,63
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,50
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 60,48
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,17
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 130.
Da: Revaluation Books, Exeter, Regno Unito
EUR 77,78
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 130 pages. 9.50x6.50x0.75 inches. In Stock.
Lingua: Inglese
Editore: Springer International Publishing, Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. 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: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer International Publishing Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloBuch. 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. 128 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 80,84
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 130.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 80,30
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 130.
Lingua: Inglese
Editore: Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Da: moluna, Greven, Germania
EUR 48,37
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.
Lingua: Inglese
Editore: Springer, Springer Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 128 pp. Englisch.