Cantitate/Preț
Produs
Total produse
Vezi coșul
Constraint Solving and Planning with Picat de Neng-Fa Zhou

Constraint Solving and Planning with Picat: SpringerBriefs in Intelligent Systems

Autor Neng-Fa Zhou, Håkan Kjellerstrand, Jonathan Fruhman
en Limba Engleză Paperback – 16 noi 2015
This book introduces a new logic-based multi-paradigm programming language that integrates logic programming, functional programming, dynamic programming with tabling, and scripting, for use in solving combinatorial search problems, including CP, SAT, and MIP (mixed integer programming) based solver modules, and a module for planning that is implemented using tabling.
The book is useful for undergraduate and graduate students, researchers, and practitioners.
Citește tot Restrânge

Din seria SpringerBriefs in Intelligent Systems

Preț: 34270 lei

Preț vechi: 42838 lei
-20%

Puncte Express: 514

Carte tipărită la comandă

Livrare economică 12-26 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319258812
ISBN-10: 3319258818
Pagini: 160
Ilustrații: XI, 148 p. 40 illus., 31 illus. in color.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:1st edition 2015
Editura: Springer
Colecția SpringerBriefs in Intelligent Systems
Seria SpringerBriefs in Intelligent Systems

Locul publicării:Cham, Switzerland

Public țintă

Upper undergraduate

Cuprins

An Overview of Picat.- Basic Constraint Modeling.- Advanced Constraint Modeling.- Dynamic Programming with Tabling.- From Dynamic Programming to Planning.- Planning with Resource-Bounded Search.- Encodings for the Traveling Salesman Problem.- Index.

Textul de pe ultima copertă

This book introduces a new logic-based multi-paradigm programming language that integrates logic programming, functional programming, dynamic programming with tabling, and scripting, for use in solving combinatorial search problems, including CP, SAT, and MIP (mixed integer programming) based solver modules, and a module for planning that is implemented using tabling.
The book is useful for undergraduate and graduate students, researchers, and practitioners.

Caracteristici

Appropriate for undergraduate and graduate students, researchers, and practitioners Authors combine academic and practical developer community experience Exercises encourage readers to practice the presented modeling techniques Includes supplementary material: sn.pub/extras