Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12735
Editat de Peter J. Stuckeyen Limba Engleză Paperback – 17 iun 2021
The 30 regular papers presented were carefully reviewed and selected from a total of 75 submissions. The conference program included a Master Class on the topic "Explanation and Verification of Machine Learning Models".
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 328.94 lei
Preț vechi: 411.17 lei
-20%
Puncte Express: 493
Preț estimativ în valută:
58.24€ • 67.81$ • 50.59£
58.24€ • 67.81$ • 50.59£
Carte tipărită la comandă
Livrare economică 23 februarie-09 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030782290
ISBN-10: 3030782298
Pagini: 468
Ilustrații: XVII, 468 p. 95 illus., 81 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.68 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3030782298
Pagini: 468
Ilustrații: XVII, 468 p. 95 illus., 81 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.68 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
Supercharging Plant Configurations using Z3.- Why You Should Constrain Your Machine Learned Models.- Contextual Optimization: Bridging Machine Learning and Operations.- A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects.- Strengthening of feasibility cuts in logic-based Benders decomposition.- Learning Variable Activity Initialisation for Lazy Clause Generation Solvers.- A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem.- Partitioning Students into Cohorts during COVID-19.- A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble.- Complete Symmetry Breaking Constraints for the Class of Uniquely Hamiltonian Graphs.- Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding.- Combining Constraint Programming and Temporal Decomposition Approaches - Scheduling of an Industrial Formulation Plant.- The Traveling Social Golfer Problem: the case of the Volleyball Nations League.- Towards a Compact SAT-based Encoding of Itemset Mining Tasks.- A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming.- MDDs boost equation solving on discrete dynamical systems.- Variable Ordering for Decision Diagrams: A Portfolio Approach.- Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors.- Improving the Filtering of Branch-And-Bound MDD solver.- On the Usefulness of Linear Modular Arithmetic in Constraint Programming.- Injecting Domain Knowledge in Neural Networks: a Controlled Experiment on a Constrained Problem.- Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems.- Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations.- Logic-Based Benders Decomposition for an Inter-modal Transportation Problem.- Checking ConstraintSatisfaction.- Finding Subgraphs with Side Constraints.- Short-term scheduling of production fleets in underground mines using CP-based LNS.- Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling.- SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning.- Learning to Sparsify Travelling Salesman Problem Instances.- Optimized Item Selection to Boost Exploration for Recommender Systems.- Improving Branch-and-Bound using Decision Diagrams and Reinforcement Learning.- Physician Scheduling During a Pandemic.