000845734 000__ 06492cam\a2200589Mi\4500
000845734 001__ 845734
000845734 005__ 20230306145034.0
000845734 006__ m\\\\\o\\d\\\\\\\\
000845734 007__ cr\nn\nnnunnun
000845734 008__ 180822s2018\\\\sz\\\\\\o\\\\\100\0\eng\d
000845734 019__ $$a1050609398
000845734 020__ $$a9783319983349$$q(electronic book)
000845734 020__ $$a3319983342$$q(electronic book)
000845734 020__ $$z9783319983332
000845734 020__ $$z3319983334
000845734 0247_ $$a10.1007/978-3-319-98334-9$$2doi
000845734 035__ $$aSP(OCoLC)on1049851787
000845734 035__ $$aSP(OCoLC)1049851787$$z(OCoLC)1050609398
000845734 040__ $$aUCW$$beng$$cUCW$$dOCLCO$$dGW5XE$$dNLE$$dYDX$$dUAB
000845734 049__ $$aISEA
000845734 050_4 $$aQA76.612
000845734 08204 $$a005.131$$223
000845734 1112_ $$aCP (Conference)$$n(24th :$$d2018 :$$cLille, France)
000845734 24510 $$aPrinciples and Practice of Constraint Programming :$$b24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /$$cedited by John Hooker.
000845734 2463_ $$aCP 2018
000845734 264_1 $$aCham :$$bSpringer,$$c2018.
000845734 300__ $$a1 online resource (xxvii, 764 pages) :$$billustrations.
000845734 336__ $$atext$$btxt$$2rdacontent
000845734 337__ $$acomputer$$bc$$2rdamedia
000845734 338__ $$aonline resource$$bcr$$2rdacarrier
000845734 347__ $$atext file$$bPDF$$2rda
000845734 4901_ $$aLecture Notes in Computer Science,$$x0302-9743 ;$$v11008
000845734 4901_ $$aLNCS sublibrary. SL 2, Programming and software engineering
000845734 5050_ $$aMain Technical Track -- Automatic Discovery and Exploitation of Promising Subproblems for Tabulation -- Propagating regular membership with dashed strings -- A Constraint-based Encoding for Domain-Independent Temporal Planning -- Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class -- Domain Reduction for Valued Constraints by Generalising Methods from CSP -- Solver-independent Large Neighbourhood Search -- Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers -- An SMT Approach to Fractional Hypertree Width -- On the non-Degeneracy of Unsatisfiability Proof Graphs produced by SAT Solvers -- Sequential Precede Chain for value symmetry elimination -- An Incremental SAT-Based Approach to Reason Efficiently On Qualitative Constraint Network -- Clause Learning and New Bounds for Graph Coloring -- Portfolio-based algorithm selection for circuit QBFs -- Making Compact-Table Compact -- Approximation Strategies for Incomplete MaxSAT -- A novel graph-based heuristic approach for solving sport scheduling problem -- Augmenting Stream Constraint Programming with Eventuality Conditions -- A Complete Tolerant Algebraic Side-Channel Attack for AES with CP -- Evaluating QBF Solvers: Quantifier Alternations Matter -- The Quantified Valued Constraint Satisfaction Problem -- MLIC: A MaxSAT-Based framework for learning interpretable classification rules -- Objective as a Feature for Robust Search Strategies -- PW-ACBit: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints -- Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice -- Efficient Methods for Constraint Acquisition -- A Circuit Consellmanntraint for Multiple Tours Problems -- Towards Semi-Automatic Learning-based Model Transformation -- Finding solutions by finding inconsistencies -- The Effect of Structural Measures and Merges on SAT Solver Performance -- Learning-Sensitive Backdoors with Restarts -- Applications Track -- Process Plant Layout Optimization: Equipment Allocation -- A Constraint Programming Approach for Solving Patient Transportation Problems -- Unifying Reserve Design Strategies with Graph Theory and Constraint Programming -- Self-Configuring Cost-Sensitive Hierarchical Clustering With Recourse -- CP and Data Science Track -- User's constraints in itemset mining -- On Maximal Frequent Itemsets Mining With Constraints -- A Parallel SAT based Framework for Closed Frequent Itemsets Mining -- Effective Deep Learning for Constraint Satisfaction Problems -- CP and Music Track -- Extending the Capacity of 1/f Noise Generation -- CP and Operations Research Track -- Securely and Automatically Deploying Micro-Services in an Hybrid Cloud Infrastructure -- Improving Energetic Propagations for Cumulative Scheduling -- CP, Optimization, and Power System Management Track -- A Fast and Scalable Algorithm for Scheduling Large Numbers of Devices under Real-Time Pricing -- Multiagent and Parallel CP Track -- Balancing Asymmetry in Max-sum using Split Constraint Factor Graphs -- A Large Neighboring Search Schema for Multi-Agent Optimization -- Distributed constrained search by selfish agents for efficient equilibria -- Testing and Verification Track -- Metamorphic Testing of Constraint Solvers -- Algebraic Fault Attack on SHA Hash Functions using Programmatic SAT Solvers.
000845734 506__ $$aAccess limited to authorized users.
000845734 520__ $$aThis book constitutes the proceedings of the 24th International Conference on Principles and Practice of Constraint Programming, CP 2018, held in Lille, France, in August 2018. The 41 full and 9 short papers presented in this volume were carefully reviewed and selected from 114 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: main technical track; applications track; CP and data science; CP and music; CP and operations research; CP, optimization and power system management; multiagent and parallel CP; and testing and verification.
000845734 650_0 $$aConstraint programming (Computer science)$$vCongresses.
000845734 650_0 $$aComputer science.
000845734 650_0 $$aComputer organization.
000845734 650_0 $$aSoftware engineering.
000845734 650_0 $$aData structures (Computer science)
000845734 650_0 $$aLogic, Symbolic and mathematical.
000845734 650_0 $$aComputer science$$xMathematics.
000845734 650_0 $$aArtificial intelligence.
000845734 7001_ $$aHooker, John,$$d1949-$$eeditor.
000845734 77608 $$iPrint version: $$z9783319983332
000845734 830_0 $$aLecture notes in computer science ;$$v11008.
000845734 830_0 $$aLNCS sublibrary.$$nSL 2,$$pProgramming and software engineering.
000845734 852__ $$bebk
000845734 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-98334-9$$zOnline Access$$91397441.1
000845734 909CO $$ooai:library.usi.edu:845734$$pGLOBAL_SET
000845734 980__ $$aEBOOK
000845734 980__ $$aBIB
000845734 982__ $$aEbook
000845734 983__ $$aOnline
000845734 994__ $$a92$$bISE