17. CP 2011:
Perugia,
Italy
Jimmy Ho-Man Lee (Ed.):
Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings.
Lecture Notes in Computer Science 6876 Springer 2011, ISBN 978-3-642-23785-0
Invited Talks
Application Track Papers
- Nicolas Beldiceanu, Helmut Simonis:
A Constraint Seeker: Finding and Ranking Global Constraints from Examples.
12-26
- Fabien Hermenier, Sophie Demassey, Xavier Lorca:
Bin Repacking Scheduling in Virtualized Datacenters.
27-41
- Michel P. Lefebvre, Jean-François Puget, Petr Vilím:
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming.
42-53
- Venkatesh Ramamoorthy, Marius-Calin Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo:
The Design of Cryptographic S-Boxes Using CSPs.
54-68
- Andreas Schutt, Peter J. Stuckey, Andrew R. Verden:
Optimal Carpet Cutting.
69-84
- Martin Stølevik, Tomas Eric Nordlander, Atle Riise, Helle Frøyseth:
A Hybrid Approach for Solving Real-World Nurse Rostering Problems.
85-99
- Gérard Verfaillie, Cédric Pralet:
Constraint Programming for Controller Synthesis.
100-114
Research Track Papers
- Andrea Bartolini, Michele Lombardi, Michela Milano, Luca Benini:
Neuron Constraints to Model Complex Real-World Problems.
115-129
- Alessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano:
A Constraint Based Approach to Cyclic RCPSP.
130-144
- Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon:
An Efficient Light Solver for Querying the Semantic Web.
145-159
- David A. Cohen, Martin C. Cooper, Martin J. Green, Dániel Marx:
On Guaranteeing Polynomially Bounded Search Tree Size.
160-171
- Jean-François Condotta, Christophe Lecoutre:
A Framework for Decision-Based Consistencies.
172-186
- Martin C. Cooper, Stanislav Zivny:
Hierarchically Nested Convex VCSP.
187-194
- Martin C. Cooper, Stanislav Zivny:
Tractable Triangles.
195-209
- Páidí Creed, Stanislav Zivny:
On Minimal Weighted Clones.
210-224
- Jessica Davies, Fahiem Bacchus:
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances.
225-239
- Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien:
Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource.
240-255
- Samir A. Mohamed Elsayed, Laurent Michel:
Synthesis of Search Algorithms from High-Level CP Models.
256-270
- Jean-Guillaume Fages, Xavier Lorca:
Revisiting the tree Constraint.
271-285
- Thibaut Feydy, Zoltan Somogyi, Peter J. Stuckey:
Half Reification and Flattening.
286-301
- Serge Gaspers, Stefan Szeider:
The Parameterized Complexity of Local Consistency.
302-316
- Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras:
Symmetry Breaking in Numeric Constraint Problems.
317-324
- Georg Gottlob:
On Minimal Constraint Networks.
325-339
- Gianluigi Greco, Francesco Scarcello:
Structural Tractability of Constraint Optimization.
340-355
- Diarmuid Grimes, Emmanuel Hebrard:
Models and Strategies for Variants of the Job Shop Scheduling Problem.
356-372
- Jinsong Guo, Zhanshan Li, Liang Zhang, Xuena Geng:
MaxRPC Algorithms Based on Bitwise Operations.
373-384
- Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning.
385-399
- Siddhartha Jain, Pascal Van Hentenryck:
Large Neighborhood Search for Dial-a-Ride Problems.
400-413
- Mikolás Janota, João P. Marques Silva:
On Deciding MUS Membership with QBF.
414-428
- Matti Järvisalo:
On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.
429-437
- Peter Jonsson, Fredrik Kuivinen, Johan Thapper:
Min CSP on Four Elements: Moving beyond Submodularity.
438-453
- Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Selection and Scheduling.
454-469
- Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, Meinolf Sellmann:
Incorporating Variance in Impact-Based Search.
470-477
- Roger Kameugne, Laure Pauline Fotso, Joseph Scott, Youcheu Ngo-Kateu:
A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints.
478-492
- Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
A CSP Solver Focusing on fac Variables.
493-507
- Ronan LeBras, Theodoros Damoulas, John M. Gregoire, Ashish Sabharwal, Carla P. Gomes, R. Bruce van Dover:
Constraint Reasoning and Kernel Clustering for Pattern Decomposition with Scaling.
508-522
- Weiming Liu, Sheng-sheng Wang, Sanjiang Li, Dayou Liu:
Solving Qualitative Constraints Involving Landmarks.
523-537
- Runming Lu, Sheng Liu, Jian Zhang:
Searching for Doubly Self-orthogonal Latin Squares.
538-545
- Barnaby Martin:
QCSP on Partially Reflexive Forests.
546-560
- Barnaby Martin, Daniël Paulusma:
The Computational Complexity of Disconnected Cut and 2K 2-Partition.
561-575
- Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Boi Faltings, Hiroshi Matsuo:
Reducing the Search Space of Resource Constrained DCOPs.
576-590
- Christopher Mears, Todd Niven, Marcel Jackson, Mark Wallace:
Proving Symmetries by Model Transformation.
591-605
- Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering.
606-620
- Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Boolean Equi-propagation for Optimized SAT Encoding.
621-636
- Samba Ndojh Ndiaye, Christine Solnon:
CP Models for Maximum Common Subgraph Problems.
637-644
- Muhammad Abdul Hakim Newton, Duc Nghia Pham, Abdul Sattar, Michael J. Maher:
Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation.
645-659
- Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings:
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds.
660-674
- Oswaldo Olivo, E. Allen Emerson:
A More Efficient BDD-Based QBF Solver.
675-690
- Tivadar Papai, Parag Singla, Henry A. Kautz:
Constraint Propagation for Efficient Inference in Markov Logic.
691-705
- Marie Pelleau, Charlotte Truchet, Frédéric Benhamou:
Octagonal Domains for Continuous Constraints.
706-720
- Thierry Petit, Jean-Charles Régin, Nicolas Beldiceanu:
A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint.
721-728
- Christopher Jefferson, Karen E. Petrie:
Automatic Generation of Constraints for Partial Symmetry Breaking.
729-743
- Cédric Pralet, Gérard Verfaillie:
Beyond QCSP for Solving Control Problems.
744-758
- Emma Rollon, Javier Larrosa:
On Mini-Buckets and the Min-fill Elimination Ordering.
759-773
- Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz, Peter J. Stuckey:
Search Combinators.
774-788
- Allen Van Gelder:
Variable Independence and Resolution Paths for Quantified Boolean Formulas.
789-803
- Nic Wilson, Walid Trabelsi:
Pruning Rules for Constrained Optimisation for Conditional Preferences.
804-818
- Justin Yip, Pascal Van Hentenryck:
Checking and Filtering Global Set Constraints.
819-833
Last update Thu May 24 04:15:22 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page