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ț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 567.60 lei
- 20% Preț: 238.01 lei
- 15% Preț: 568.74 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 373.56 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 632.22 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 809.19 lei
- 20% Preț: 579.56 lei
- 20% Preț: 649.49 lei
- 20% Preț: 330.23 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 326.98 lei
- 20% Preț: 256.27 lei
- 20% Preț: 444.17 lei
- 20% Preț: 571.63 lei
- 20% Preț: 575.48 lei
- 20% Preț: 574.05 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 747.79 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 569.19 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.08 lei
Preț vechi: 418.85 lei
-20% Nou
Puncte Express: 503
Preț estimativ în valută:
64.13€ • 67.28$ • 53.20£
64.13€ • 67.28$ • 53.20£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
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.