Sais Lakhdar (26 results)

Softcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 2008. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2008. Ammareal gives back up to 15% of this item's net price to charity organizations.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Handbook of Parallel Constraint Reasoning | Lakhdar Sais (u. a.) | Taschenbuch | xxvi | Englisch | 2019 | Springer | EAN 9783030096946 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: New. New. book.

Buch. Condition: Neu. Neuware -This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 704 pp. Englisch.

Hardcover. Condition: Brand New. 677 pages. 9.75x6.50x1.50 inches. In Stock.

Condition: fine. très bon état. Optez pour nos livres d'occasion en très bon état, et soutenez l'insertion sociale et l'écologie en leur offrant une seconde vie. 368578-2 - Problème SAT progrès et défis, SAÏS, Lakhdar, 2008.

Condition: Neuf.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Condition: new. Questo è un articolo print on demand.

Condition: new. Questo è un articolo print on demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning. 704 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal i.

Condition: New. Print on Demand pp. 704.

Condition: New. PRINT ON DEMAND pp. 704.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 704 pp. Englisch.

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal i.

Buch. Condition: Neu. Handbook of Parallel Constraint Reasoning | Lakhdar Sais (u. a.) | Buch | xxvi | Englisch | 2018 | Springer International Publishing | EAN 9783319635156 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A\*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning. 704 pp. Englisch.