default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th CP 2018: Lille, France
- John N. Hooker:
Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Lecture Notes in Computer Science 11008, Springer 2018, ISBN 978-3-319-98333-2
Main Technical Track
- Özgür Akgün
, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon:
Automatic Discovery and Exploitation of Promising Subproblems for Tabulation. 3-12 - Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Propagating Regular Membership with Dashed Strings. 13-29 - Arthur Bit-Monnot:
A Constraint-Based Encoding for Domain-Independent Temporal Planning. 30-46 - Massimo Bono, Alfonso Emilio Gerevini:
Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class. 47-63 - Martin C. Cooper, Wafa Jguirim, David A. Cohen:
Domain Reduction for Valued Constraints by Generalising Methods from CSP. 64-80 - Jip J. Dekker, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack:
Solver-Independent Large Neighbourhood Search. 81-98 - Emir Demirovic, Geoffrey Chu, Peter J. Stuckey:
Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers. 99-108 - Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider:
An SMT Approach to Fractional Hypertree Width. 109-127 - Rohan Fossé, Laurent Simon:
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers. 128-143 - Graeme Gange, Peter J. Stuckey:
Sequential Precede Chain for Value Symmetry Elimination. 144-159 - Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis:
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. 160-178 - Emmanuel Hebrard, George Katsirelos:
Clause Learning and New Bounds for Graph Coloring. 179-194 - Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Portfolio-Based Algorithm Selection for Circuit QBFs. 195-209 - Linnea Ingmar, Christian Schulte:
Making Compact-Table Compact. 210-218 - Saurabh Joshi, Prateek Kumar, Ruben Martins, Sukrut Rao:
Approximation Strategies for Incomplete MaxSAT. 219-228 - Meriem Khelifa, Dalila Boughaci, Esma Aïmeur:
A Novel Graph-Based Heuristic Approach for Solving Sport Scheduling Problem. 229-241 - Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. Zhong:
Augmenting Stream Constraint Programming with Eventuality Conditions. 242-258 - Fanghui Liu, Waldemar Cruz, Laurent Michel:
A Complete Tolerant Algebraic Side-Channel Attack for AES with CP. 259-275 - Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. 276-294 - Florent R. Madelaine, Stéphane Secouard:
Quantified Valued Constraint Satisfaction Problem. 295-311 - Dmitry Malioutov, Kuldeep S. Meel:
MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules. 312-327 - Anthony Palmieri, Guillaume Perez:
Objective as a Feature for Robust Search Strategies. 328-344 - Anthony Schneider, Berthe Y. Choueiry:
PW-AC: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints. 345-361 - Patrick Spracklen, Özgür Akgün, Ian Miguel:
Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice. 362-372 - Dimosthenis C. Tsouros, Kostas Stergiou, Panagiotis G. Sarigiannidis:
Efficient Methods for Constraint Acquisition. 373-388 - Philippe Vismara, Nicolas Briot:
A Circuit Constraint for Multiple Tours Problems. 389-402 - Kiana Zeighami, Kevin Leo, Guido Tack, Maria Garcia de la Banda:
Towards Semi-Automatic Learning-Based Model Transformation. 403-419 - Ghiles Ziat, Marie Pelleau, Charlotte Truchet, Antoine Miné:
Finding Solutions by Finding Inconsistencies. 420-435 - Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Jia Hui Liang, Krzysztof Czarnecki, Vijay Ganesh:
The Effect of Structural Measures and Merges on SAT Solver Performance. 436-452 - Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Hui Liang, Krzysztof Czarnecki, Vijay Ganesh:
Learning-Sensitive Backdoors with Restarts. 453-469
Applications Track
- Gleb Belov, Tobias Czauderna, Maria Garcia de la Banda, Matthias Klapperstück, Ilankaikone Senthooran, Mitch Smith, Michael Wybrow, Mark Wallace:
Process Plant Layout Optimization: Equipment Allocation. 473-489 - Quentin Cappart, Charles Thomas, Pierre Schaus, Louis-Martin Rousseau:
A Constraint Programming Approach for Solving Patient Transportation Problems. 490-506 - Dimitri Justeau-Allaire, Philippe Birnbaum, Xavier Lorca:
Unifying Reserve Design Strategies with Graph Theory and Constraint Programming. 507-523 - Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney:
Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. 524-534
CP and Data Science Track
- Christian Bessiere, Nadjib Lazaar, Mehdi Maamar:
User's Constraints in Itemset Mining. 537-553 - Saïd Jabbour, Fatima Ezzahra Mana, Imen Ouled Dlala, Badran Raddaoui, Lakhdar Sais:
On Maximal Frequent Itemsets Mining with Constraints. 554-569 - Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining. 570-587 - Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Effective Deep Learning for Constraint Satisfaction Problems. 588-597
CP and Music Track
- Guillaume Perez, Brendan Rappazzo, Carla P. Gomes:
Extending the Capacity of 1 / f Noise Generation. 601-610
CP and Operations Research Track
- Waldemar Cruz, Fanghui Liu, Laurent Michel:
Securely and Automatically Deploying Micro-services in an Hybrid Cloud Infrastructure. 613-628 - Alexander Tesch:
Improving Energetic Propagations for Cumulative Scheduling. 629-645
CP, Optimization, and Power System Management Track
- Shan He, Mark Wallace, Graeme Gange, Ariel Liebman, Campbell Wilson:
A Fast and Scalable Algorithm for Scheduling Large Numbers of Devices Under Real-Time Pricing. 649-666
Multiagent and Parallel CP Track
- Liel Cohen, Roie Zivan:
Balancing Asymmetry in Max-sum Using Split Constraint Factor Graphs. 669-687 - Khoi D. Hoang, Ferdinando Fioretto, William Yeoh, Enrico Pontelli, Roie Zivan:
A Large Neighboring Search Schema for Multi-agent Optimization. 688-706 - Vadim Levit, Amnon Meisels:
Distributed Constrained Search by Selfish Agents for Efficient Equilibria. 707-724
Testing and Verification Track
- Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Metamorphic Testing of Constraint Solvers. 727-736 - Saeed Nejati, Jan Horácek, Catherine H. Gebotys, Vijay Ganesh:
Algebraic Fault Attack on SHA Hash Functions Using Programmatic SAT Solvers. 737-754
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-19 23:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
