14. CP 2008: Sydney, NSW, Australia

Invited Lecture

• Alain Colmerauer:
  Back to the Complexity of Universal Programs. 1-20
  

Applications Track Long Papers

• Luca Benini, Michele Lombardi, Michela Milano, Martino Ruggiero:
  A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine. 21-35
  
• Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes:
  Planning and Scheduling the Operation of a Very Large Oil Pipeline Network. 36-51
  
• Helmut Simonis, Barry O'Sullivan:
  Search Strategies for Rectangle Packing. 52-66
  
• David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
  Solving a Telecommunications Feature Subscription Configuration Problem. 67-81
  
• Iván Dotú, Manuel Cebrián, Pascal Van Hentenryck, Peter Clote:
  Protein Structure Prediction with Large Neighborhood Constraint Programming Search. 82-96
  
• Abid M. Malik, Michael Chase, Tyrel Russell, Peter van Beek:
  An Application of Constraint Programming to Superblock Instruction Scheduling. 97-111
  

Research Track Long Papers

• Stanislav Zivny, Peter Jeavons:
  Classes of Submodular Constraints Expressible by Graph Cuts. 112-127
  
• Christophe Lecoutre:
  Optimization of Simple Tabular Reduction for Table Constraints. 128-143
  
• Jinbo Huang:
  Universal Booleanization of Constraint Models. 144-158
  
• Michael J. Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
  Flow-Based Propagators for the SEQUENCE and Related Global Constraints. 159-174
  
• Guillaume Verger, Christian Bessiere:
  Guiding Search in QCSP⁺ with Back-Propagation. 175-189
  
• Alexandre Goldsztejn, Laurent Granvilliers:
  A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. 190-204
  
• Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou:
  A Branch and Bound Algorithm for Numerical MAX-CSP. 205-219
  
• Mats Carlsson, Nicolas Beldiceanu, Julien Martin:
  A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules. 220-234
  
• Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven David Prestwich:
  Cost-Based Domain Filtering for Stochastic Constraint Programming. 235-250
  
• Meinolf Sellmann, Serdar Kadioglu:
  Dichotomic Search Protocols for Constrained Optimization. 251-265
  
• Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve:
  Length-Lex Bounds Consistency for Knapsack Constraints. 266-281
  
• T. K. Satish Kumar:
  A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. 282-297
  
• Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
  From High Girth Graphs to Hard Instances. 298-312
  
• Wanxia Wei, Chu Min Li, Harry Zhang:
  Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. 313-326
  
• Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck:
  CPBPV: A Constraint-Programming Framework for Bounded Program Verification. 327-341
  
• Ignacio Araya, Bertrand Neveu, Gilles Trombettoni:
  Exploiting Common Subexpressions in Numerical CSPs. 342-357
  
• Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon:
  A Soft Constraint of Equality: Complexity and Approximability. 358-371
  
• Martin J. Green, Christopher Jefferson:
  Structural Tractability of Propagated Constraints. 372-386
  
• Ismel Brito, Pedro Meseguer:
  Connecting ABT with Arc Consistency. 387-401
  
• Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies. 402-417
  
• Hadrien Cambazard, Barry O'Sullivan:
  Reformulating Positive Table Constraints Using Functional Dependencies. 418-432
  
• Alexandre Papadopoulos, Barry O'Sullivan:
  Relaxations for Compiled Over-Constrained Problems. 433-447
  
• Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Peter Tiedemann:
  Approximate Compilation of Constraints into Multivalued Decision Diagrams. 448-462
  
• Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
  Quantified Constraint Optimization. 463-477
  
• Matthew Kitching, Fahiem Bacchus:
  Exploiting Decomposition in Constraint Optimization Problems. 478-492
  
• Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
  A Coinduction Rule for Entailment of Recursively Defined Properties. 493-508
  
• Kenil C. K. Cheng, Roland H. C. Yap:
  Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints. 509-523
  

Research Track Short Papers

• András Z. Salamon, Peter G. Jeavons:
  Perfect Constraints Are Tractable. 524-528
  
• Karen E. Petrie, Christopher Jefferson:
  Efficiently Solving Problems Where the Solutions Form a Group. 529-533
  
• Vibhav Gogate, Rina Dechter:
  Approximate Solution Sampling (and Counting) on AND/OR Spaces. 534-538
  
• Daniel S. Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip:
  Model Restarts for Structural Symmetry Breaking. 539-544
  
• Yuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti:
  An Elimination Algorithm for Functional Constraints. 545-549
  
• Anbulagan, Adi Botea:
  Crossword Puzzles as a Constraint Problem. 550-554
  
• Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo:
  Recent Hybrid Techniques for the Multi-Knapsack Problem. 555-559
  
• Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
  Edge Matching Puzzles as Hard SAT/CSP Benchmarks. 560-565
  
• Martin Sachenbacher, Paul Maier:
  Test Strategy Generation Using Quantified CSPs. 566-570
  
• Christian Schulte, Guido Tack:
  Perfect Derived Propagators. 571-575
  
• Lars Otten, Rina Dechter:
  Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. 576-581
  
• Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes:
  Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. 582-587
  
• Frank Raiser:
  Semi-automatic Generation of CHR Solvers for Global Constraints. 588-592
  
• Dalila Boughaci, Belaid Benhamou, Habiba Drias:
  Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. 593-597
  
• Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
  Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. 598-602
  
• Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea:
  Computing All Optimal Solutions in Satisfiability Problems with Preferences. 603-607
  
• Marco Correia, Pedro Barahona:
  On the Efficiency of Impact Based Heuristics. 608-612
  
• Eric I. Hsu, Christian J. Muise, J. Christopher Beck, Sheila A. McIlraith:
  Probabilistically Estimating Backbones and Variable Bias: Experimental Overview. 613-617
  
• Peter Gregory, Maria Fox, Derek Long:
  A New Empirical Study of Weak Backdoors. 618-623
  
• Reza Rafeh, Kim Marriott, Maria Garcia de la Banda, Nicholas Nethercote, Mark Wallace:
  Adding Search to Zinc. 624-629
  
• Gilles Audemard, Laurent Simon:
  Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. 630-634
  
• Kenil C. K. Cheng, Roland H. C. Yap:
  Search Space Reduction for Constraint Optimization Problems. 635-639
  
• Steven Halim, Roland H. C. Yap, Felix Halim:
  Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem. 640-645
  

Last update Wed May 22 23:07:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page