• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 122 matches

• 2005
• 
  Montserrat Abril, Miguel A. Salido, Federico Barber:
  Distributed Constraints for Large-Scale Scheduling Problems. CP 2005: 837
• 
  Magnus Ågren, Pierre Flener, Justin Pearson:
  Incremental Algorithms for Local Search from Existential Second-Order Logic. CP 2005: 47-61
• 
  Anbulagan, John K. Slaney:
  Lookahead Saturation with Restriction for SAT. CP 2005: 727-731
• 
  Josep Argelich, Felip Manyà:
  Solving Over-Constrained Problems with SAT. CP 2005: 838
• 
  Konstantin Artiouchine, Philippe Baptiste:
  Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76
• 
  Stuart Bain, John Thornton, Abdul Sattar:
  Evolving Variable-Ordering Heuristics for Constrained Optimisation. CP 2005: 732-736
• 
  Heikel Batnini, Claude Michel, Michel Rueher:
  Mind the Gaps: A New Splitting Strategy for Consistency Techniques. CP 2005: 77-91
• 
  J. Christopher Beck:
  Multi-point Constructive Search. CP 2005: 737-741
• 
  Ramón Béjar, Cèsar Fernández, Carles Mateu:
  Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861
• 
  Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet:
  Graph Invariants as Necessary Conditions for Global Constraints. CP 2005: 92-106
• 
  Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
  Bounds of Graph Characteristics. CP 2005: 742-746
• 
  Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano:
  Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation. CP 2005: 107-121
• 
  Russell Bent, Irit Katriel, Pascal Van Hentenryck:
  Sub-optimality Approximations. CP 2005: 122-136
• 
  Christian Bessiere, Remi Coletta, Thierry Petit:
  Acquiring Parameters of Implied Global Constraints. CP 2005: 747-751
• 
  Hariolf Betz, Thom W. Frühwirth:
  A Linear-Logic Semantics for Constraint Handling Rules. CP 2005: 137-151
• 
  Ismel Brito, Pedro Meseguer:
  Distributed Stable Matching Problems. CP 2005: 152-166
• 
  Alexander Brodsky, Hadon Nash:
  CoJava: A Unified Language for Simulation and Optimization. CP 2005: 877-877
• 
  David A. Burke, Kenneth N. Brown:
  A Constraint Based Agent for TAC-SCM. CP 2005: 839
• 
  Mihaela Butaru, Zineb Habbas:
  Solving the Car-Sequencing Problem as a Non-binary CSP. CP 2005: 840
• 
  Hadrien Cambazard, Narendra Jussien:
  Integrating Benders Decomposition Within Constraint Programming. CP 2005: 752-756
• 
  Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouquard:
  Dimensioning an Inbound Call Center Using Constraint Programming. CP 2005: 841
• 
  Tom Carchrae, J. Christopher Beck, Eugene C. Freuder:
  Methods to Learn Abstract Scheduling Models. CP 2005: 842
• 
  Pavel Cejnar, Roman Barták:
  Automated Search for Heuristic Functions. CP 2005: 843
• 
  Le Chang, Alan K. Mackworth:
  Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference. CP 2005: 844
• 
  Hubie Chen, Víctor Dalmau:
  Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP 2005: 167-181
• 
  Kenil C. K. Cheng, Roland H. C. Yap:
  Ad-hoc Global Constraints for Life. CP 2005: 182-195
• 
  David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
  Symmetry Definitions for Constraint Satisfaction Problems. CP 2005: 17-31
• 
  Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien:
  Tractable Clones of Polynomials over Semigroups. CP 2005: 196-210
• 
  Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais:
  Using Boolean Constraint Propagation for Sub-clauses Deduction. CP 2005: 757-761
• 
  Bistra Dilkina, Lei Duan, William S. Havens:
  Extending Systematic Local Search for Job Shop Scheduling Problems. CP 2005: 762-766

skipping 92 more matches