default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th CP 2001: Paphos, Cyprus
- Toby Walsh:
Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings. Lecture Notes in Computer Science 2239, Springer 2001, ISBN 3-540-42863-1 - Andrew Eremin, Mark Wallace:
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. 1-15 - Erlendur S. Thorsteinsson:
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. 16-30 - Slim Abdennadher, Christophe Rigotti:
Towards Inductive Constraint Solving. 31-45 - Susan L. Epstein, Eugene C. Freuder:
Collaborative Learning for Constraint Solving. 46-60 - Thierry Benoist, Eric Bourreau, Yves Caseau, Benoît Rottembourg:
Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines. 61-76 - Filippo Focacci, Michela Milano:
Global Cut Framework for Removing Symmetries. 77-92 - Torsten Fahle, Stefan Schamberger, Meinolf Sellmann:
Symmetry Breaking. 93-107 - Olivier Dubois, Gilles Dequen
:
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. 108-120 - Alfonso San Miguel Aguirre, Moshe Y. Vardi:
Random 3-SAT and BDDs: The Plot Thickens Further. 121-136 - Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Capturing Structure with Satisfiability. 137-152 - Weixiong Zhang:
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. 153-167 - Nikos Mamoulis, Kostas Stergiou:
Solving Non-binary CSPs Using the Hidden Variable Encoding. 168-182 - Gilles Pesant:
A Filtering Algorithm for the Stretch Constraint. 183-195 - Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun:
Network Flow Problems in Constraint Programming. 196-210 - Nicolas Beldiceanu:
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. 211-224 - Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith:
A Constraint Programming Approach to the Stable Marriage Problem. 225-239 - Chiu Wo Choi, Martin Henz, Ka Boon Ng:
Components for State Restoration in Tree Search. 240-255 - Armin Wolf:
Adaptive Constraint Handling with CHR in Java. 256-270 - Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Consistency Maintenance for ABT. 271-285 - Giorgio Delzanno, Tevfik Bultan:
Constraint-Based Verification of Client-Server Protocols. 286-301 - Catuscia Palamidessi, Frank D. Valencia:
A Temporal Concurrent Constraint Programming Calculus. 302-316 - Pedro Meseguer, Javier Larrosa, Martí Sánchez-Fibla:
Lower Bounds for Non-binary Constraint Optimization Problems. 317-331 - Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget:
New Lower Bounds of Constraint Violations for Over-Constrained Problems. 332-345 - Rina Dechter, Kalev Kask, Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. 346-360 - Kim Marriott, Peter Moulder, Peter J. Stuckey, Alan Borning:
Solving Disjunctive Constraints for Interactive Graphical Applications. 361-376 - Nicolas Beldiceanu, Mats Carlsson:
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. 377-391 - Nicolas Beldiceanu, Qi Guo, Sven Thiel:
Non-overlapping Constraints between Convex Polytopes. 392-407 - Hubie Chen, Carla P. Gomes, Bart Selman:
Formal Models of Heavy-Tailed Behavior in Combinatorial Search. 408-421 - Alessandro Armando, Felice Peccia, Silvio Ranise:
The Phase Transition of the Linear Inequalities Problem. 422-432 - Phokion G. Kolaitis, Thomas Raffill:
In Search of a Phase Transition in the AC-Matching Problem. 433-450 - Thierry Petit, Jean-Charles Régin, Christian Bessière:
Specific Filtering Algorithms for Over-Constrained Problems. 451-463 - Pedro Meseguer, Martí Sánchez-Fibla:
Specializing Russian Doll Search. 464-478 - Martin T. Swain, Graham J. L. Kemp:
A CLP Approach to the Protein Side-Chain Placement Problem. 479-493 - Rolf Backofen, Sebastian Will:
Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores. 494-508 - Martin Henz, Edgar Tan, Roland H. C. Yap:
One Flip per Clock Cycle. 509-523 - Claude Michel, Michel Rueher, Yahia Lebbah:
Solving Constraints over Floating-Point Numbers. 524-538 - Micha Janssen, Pascal Van Hentenryck, Yves Deville:
Optimal Pruning in Parametric Differential Equations. 539-553 - Francisco Azevedo, Pedro Barahona:
Interaction of Constraint Programming and Local Search for Optimisation Problems. 554-559 - Hachemi Bennaceur, Mohamed-Salah Affane:
Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency. 560-564 - Christian Bessière, Assef Chmeiss, Lakhdar Sais:
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. 565-569 - Marco Cadoli:
The Expressive Power of Binary Linear Programming. 570-574 - Simon Colton, Ian Miguel:
Constraint Generation via Automated Theory Formation. 575-579 - Kelly Easton, George L. Nemhauser, Michael A. Trick:
The Traveling Tournament Problem Description and Benchmarks. 580-584 - Eugene C. Freuder, Chavalit Likitvivatanavong, Richard J. Wallace:
Deriving Explanations and Implications for Constraint Satisfaction Problems. 585-589 - Eugene C. Freuder, Barry O'Sullivan:
Generating Tradeoffs for Interactive Constraint-Based Configuration. 590-594 - Rafael M. Gasca, Juan Antonio Ortega, Miguel Toro:
Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells. 595-599 - Laurent Granvilliers, Éric Monfroy:
Composition Operators for Constraint Propagation: An Application to Choco. 600-604 - Edward A. Hirsch, Arist Kojevnikov:
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. 605-609 - George Katsirelos, Fahiem Bacchus:
GAC on Conjunctions of Constraints. 610-614 - Barbara M. Smith:
Dual Models of Permutation Problems. 615-619 - Christine Solnon:
Boosting Local Search with Artificial Ants. 620-624 - Peter van Beek, Kent D. Wilken:
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies. 625-639 - Cecilia Ekelin, Jan Jonsson:
Evaluation of Search Heuristics for Embedded System Scheduling Problems. 640-654 - Markus P. J. Fromherz, James V. Mahoney:
Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching. 655-669 - Gérard Verfaillie, Michel Lemaître:
Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View. 670-684 - Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, Wei-Min Shen, Shriniwas Kulkarni:
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation. 685-700 - Juliette Mattioli, Nicolas Museux, Jean Jourdan, Pierre Savéant, Simon de Givry:
A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture. 701-715 - Christos Voudouris, Raphaël Dorne, David Lesaint, Anne Liret:
iOpt: A Software Toolkit for Heuristic Search Methods. 716-719 - Sylvain Merchez, Christophe Lecoutre, Frédéric Boussemart:
AbsCon: A Prototype to Solve CSPs with Abstraction. 730-744 - József Váncza, András Márkus:
A Constraint Engine for Manufacturing Process Planning. 745-759 - Amy M. Beckwith, Berthe Y. Choueiry:
On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems. 760 - Lyndon Drake:
Automatic Generation of Implied Clauses for SAT. 761 - Fabio Fioravanti:
Verification of Infinite-State Systems by Specialization of CLP Programs. 762 - Marco Gavanelli:
Partially Ordered Constraint Optimization Problems. 763 - Rosella Gennari:
Translations for Comparing Soft Frameworks. 764 - Mitchell A. Harris:
Counting Satisfiable k-CNF Formulas. 765 - Brahim Hnich:
High-Level Modelling and Reformulation of Constraint Satisfaction Problems. 766 - Hyuckchul Jung:
Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation. 767 - Erik Kilborn:
Aircraft Assignment Using Constraint Programming. 768 - Zeynep Kiziltan:
Labelling Heuristics for CSP Application Domains. 769 - Inês Lynce, João Marques-Silva:
Improving SAT Algorithms by Using Search Pruning Techniques. 770 - Iain McDonald:
Optimum Symmetry Breaking in CSPs Using Group Theory. 771 - Christian Bessière, Arnold Maestre, Pedro Meseguer:
Distributed Dynamic Backtracking. 772 - Pragnesh Jay Modi:
Constraint Programming for Distributed Resource Allocation. 773 - Nicoleta Neagu:
Exploiting the CSP Structure by Interchangeability. 774 - Andrea Panati:
Constraint Processing Techniques for Model-Based Reasoning about Dynamic Systems. 776 - Georg Ringwelski:
Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers. 777 - Louis-Martin Rousseau, Gilles Pesant, Michel Gendreau:
Building Negative Reduced Cost Paths Using Constraint Programming. 778 - Miguel A. Salido, Federico Barber:
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. 779 - Sibylle Schwarz:
Partial Stable Generated Models of Generalized Logic Programs with Constraints. 781 - Frank Seelisch:
Heterogeneous Constraint Problems. 783 - Daniel Sheridan:
Comparing SAT Encodings for Model Checking. 784 - Marius-Calin Silaghi, Stefan Sabau, Djamila Sam-Haroud, Boi Faltings:
Asynchronous Search for Numeric DisCSPs. 785 - Frank D. Valencia:
Temporal Concurrent Constraint Programming. 786
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-11-15 19:19 CET 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:
