The SCEAS System
Navigation Menu

Conferences in DBLP

Principles and Practice of Constraint Programming (CP) (cp)
1999 (conf/cp/1999)

  1. Krzysztof R. Apt
    The Rough Guide to Constraint Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:1-23 [Conf]
  2. Christian Bessière
    Non-Binary Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:24-27 [Conf]
  3. Benjamin W. Wah, Zhe Wu
    The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:28-42 [Conf]
  4. Slim Abdennadher, Thom W. Frühwirth
    Operational Equivalence of CHR Programs and Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:43-57 [Conf]
  5. Krzysztof R. Apt, Eric Monfroy
    Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:58-72 [Conf]
  6. Rolf Backofen, Sebastian Will
    Excluding Symmetries in Constraint-Based Search. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:73-87 [Conf]
  7. Christian Bessière, Pedro Meseguer, Eugene C. Freuder, Javier Larrosa
    On Forward Checking for Non-binary Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:88-102 [Conf]
  8. Christian Bessière, Jean-Charles Régin
    Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:103-117 [Conf]
  9. Marcus Bjäreland, Peter Jonsson
    Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:118-128 [Conf]
  10. Mathias Broxvall, Peter Jonsson
    Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:129-143 [Conf]
  11. Yves Caseau, François Laburthe, Glenn Silverstein
    A Meta-Heuristic Factory for Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:144-158 [Conf]
  12. Víctor Dalmau, Justin Pearson
    Closure Functions and Width 1 Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:159-173 [Conf]
  13. Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey
    An Overview of HAL. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:174-188 [Conf]
  14. Filippo Focacci, Andrea Lodi, Michela Milano
    Cost-Based Domain Filtering. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:189-203 [Conf]
  15. Christian Frei, Boi Faltings
    Resource Allocation and Constraint Satisfaction Techniques. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:204-218 [Conf]
  16. Youssef Hamadi
    Optimal Distributed Arc-Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:219-233 [Conf]
  17. Tudor Hulubei, Eugene C. Freuder
    The Goldilocks Problem. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:234-245 [Conf]
  18. Micha Janssen, Yves Deville, Pascal Van Hentenryck
    Multistep Filtering Operators for Ordinary Differential Equations. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:246-260 [Conf]
  19. Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann
    A Framework for Constraint Programming Based Column Generation. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:261-274 [Conf]
  20. Kazuya Kaneko, Masazumi Yoshikawa, Yoichiro Nakakuki
    Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:275-288 [Conf]
  21. Ludwig Krippahl, Pedro Barahona
    Applying Constraint Programming to Protein Structure Determination. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:289-302 [Conf]
  22. Javier Larrosa, Pedro Meseguer
    Partition-Based Lower Bound for Max-CSP. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:303-315 [Conf]
  23. Bernd Meyer
    Constraint Diagram Reasoning. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:316-330 [Conf]
  24. François Pachet, Pierre Roy
    Automatic Generation of Music Programs. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:331-345 [Conf]
  25. Laurent Perron
    Search Procedures and Parallelism in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:346-360 [Conf]
  26. Nicolas Prcovic, Bertrand Neveu
    Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:361-374 [Conf]
  27. Philippe Refalo
    Tight Cooperation and Its Application in Piecewise Linear Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:375-389 [Conf]
  28. Jean-Charles Régin
    Arc Consistency for Global Cardinality Constraints with Costs. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:390-404 [Conf]
  29. Barbara M. Smith
    The Brélaz Heuristic and Optimal Static Orderings. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:405-418 [Conf]
  30. Timo Soininen, Esther Gelle, Ilkka Niemelä
    A Fixpoint Definition of Dynamic Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:419-433 [Conf]
  31. Takayuki Suyama, Makoto Yokoo, Akira Nagoya
    Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:434-445 [Conf]
  32. John Thornton, Abdul Sattar
    On the Behavior and Application of Constraint Weighting. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:446-460 [Conf]
  33. Benjamin W. Wah, Tao Wang
    Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:461-475 [Conf]
  34. Stanislav Busygin
    On SAT01 Problem. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:476-477 [Conf]
  35. Jorge Cruz, Pedro Barahona
    An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:478-479 [Conf]
  36. Ian P. Gent, Toby Walsh
    CSPLIB: A Benchmark Library for Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:480-481 [Conf]
  37. Timothy J. Hickey, David K. Wittenberg
    Validated Constraint Compilation. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:482-483 [Conf]
  38. Ortrun Ibes
    Automated Theorem Proving with Disjunctive Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:484-485 [Conf]
  39. Claudio Lottaz
    Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:486-487 [Conf]
  40. Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings
    Intelligent Domain Splitting for CSPs with Ordered Domains. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:488-489 [Conf]
  41. Makoto Yokoo, Katsutoshi Hirayama
    Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:490-491 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002