Principles and Practice of Constraint Programming: Lecture Notes in Computer Science, cartea 11802
Editat de Thomas Schiex, Simon de Givryen Limba Engleză Paperback – 30 aug 2019
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 348.58 lei
Preț vechi: 435.73 lei
-20%
Puncte Express: 523
Preț estimativ în valută:
61.64€ • 70.68$ • 53.27£
61.64€ • 70.68$ • 53.27£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783030300470
ISBN-10: 3030300471
Pagini: 816
Ilustrații: XXVI, 788 p. 832 illus., 179 illus. in color.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.21 kg
Ediția:1st ed. 2019
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030300471
Pagini: 816
Ilustrații: XXVI, 788 p. 832 illus., 179 illus. in color.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.21 kg
Ediția:1st ed. 2019
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Technical Track.- Instance Generation via Generator Instances.- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming.- Vehicle routing by learning from historical solutions.- On Symbolic Approaches for Computing the Matrix Permanent.- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience.- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem.- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics.- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers.- Dual Hashing-based Algorithms for Discrete Integration.- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.- A Join-Based Hybrid Parameter for Constraint Satisfaction.- An Incremental SAT-BasedApproach to the Graph Colouring Problem.- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving.- Trimming Graphs Using Clausal Proof Optimization.- Improved Job Sequencing Bounds from Decision Diagrams.- Integration of structural constraints into TSP models.- Representing fitness landscapes by valued constraints to understand the complexity of local search.- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition.- Understanding the Empirical Hardness of Random Optimisation Problems.- Guarded Constraint Models Define Treewidth Preserving Reductions.- Automatic Streamlining for Constrained Optimisation.- Compiling Conditional Constraints.- Training Binarized Neural Networks using MIP and CP.- Application Track.- Models for Radiation Therapy Patient Scheduling.- Constraint Programming-based Job Dispatching for Modern HPC Applications.- Scheduling of Mobile Robots using Constraint Programming.- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems.- Multi-agent and Parallel CP Track.- An Improved GPU-based SAT Model Counter.- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems.- Testing and Verification Track.- A Cube Distribution Approach to QBF Solving and Certificate Minimization.- Functional Synthesis with Examples.- SolverCheck: Declarative Testing of Constraints.- Encodings for Enumeration-Based Program Synthesis.- Lemma Synthesis for Automating Induction over Algebraic Data Types.- CP and Data Science Track.- Modeling Pattern Set Mining using Boolean Circuits.- Differential Privacy of Hierarchical Census Data: An Optimization Approach.- Generic Constraint-based Block Modeling using Constraint Programming.- Reward Potentials for Planning with Learned Neural Network Transition Models.- Exploiting Counterfactuals for Scalable Stochastic Optimization.- Structure-driven Multiple Constraint Acquisition.- Computational Sustainability Track.- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach.- Peak-hour Rail Demand Shifting with Discrete Optimisation.- CP and Life Sciences Track.- Functional significance checking in noisy gene regulatory networks.