The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Henry A. Kautz, Bart Selman
    Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:1-18 [Conf]
  2. Tuomas Sandholm
    Automated Mechanism Design: A New Application Area for Search Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:19-36 [Conf]
  3. Mark Wallace
    Languages versus Packages for Constraint Problem Solving. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:37-52 [Conf]
  4. Toby Walsh
    Constraint Patterns. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:53-64 [Conf]
  5. Pascal Van Hentenryck, Laurent Michel
    Control Abstractions for Local Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:65-80 [Conf]
  6. Ola Angelsmark, Peter Jonsson
    Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:81-95 [Conf]
  7. Carlos Ansótegui, Jose Larrubia, Felip Manyà
    Boosting Chaff's Performance by Incorporating CSP Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:96-107 [Conf]
  8. Olivier Bailleux, Yacine Boufkhad
    Efficient CNF Encoding of Boolean Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:108-122 [Conf]
  9. Russell Bent, Pascal Van Hentenryck
    A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:123-137 [Conf]
  10. Stefano Bistarelli, Philippe Codognet, Kin Chuen Hui, Jimmy Ho-Man Lee
    Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:138-152 [Conf]
  11. Stéphane Bourdais, Philippe Galinier, Gilles Pesant
    HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:153-167 [Conf]
  12. Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans
    Constraint-Based Optimization with the Minimax Decision Criterion. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:168-182 [Conf]
  13. Andrei A. Bulatov, Peter Jeavons
    An Algebraic Approach to Multi-sorted Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:183-198 [Conf]
  14. Hubie Chen
    Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:199-213 [Conf]
  15. Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey
    Box Constraint Collections for Adhoc Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:214-228 [Conf]
  16. Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
    Propagation Redundancy in Redundant Modelling. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:229-243 [Conf]
  17. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    Soft Constraints: Complexity and Multimorphisms. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:244-258 [Conf]
  18. Jorge Cruz, Pedro Barahona
    Constraint Satisfaction Differential Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:259-273 [Conf]
  19. Tassos Dimitriou
    A Wealth of SAT Distributions with Planted Assignments. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:274-287 [Conf]
  20. Iván Dotú, Alvaro del Val, Manuel Cebrián
    Redundant Modeling for the QuasiGroup Completion Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:288-302 [Conf]
  21. Boi Faltings, Santiago Macho-Gonzalez
    Open Constraint Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:303-317 [Conf]
  22. Alan M. Frisch, Christopher Jefferson, Ian Miguel
    Constraints for Breaking More Row and Column Symmetries. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:318-332 [Conf]
  23. Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton
    Generic SBDD Using Computational Group Theory. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:333-347 [Conf]
  24. Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth
    Using Stochastic Local Search to Solve Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:348-362 [Conf]
  25. Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex
    Solving Max-SAT as Weighted CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:363-376 [Conf]
  26. Keith Golden, Wanlin Pang
    Constraint Reasoning over Strings. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:377-391 [Conf]
  27. Martin J. Green, David A. Cohen
    Tractability by Approximating Constraint Languages. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:392-406 [Conf]
  28. Willem Jan van Hoeve
    A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stabe Set Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:407-421 [Conf]
  29. Alan Holland, Barry O'Callaghan, Barry O'Sullivan
    A Constraint-Aided Conceptual Design Environment for Autodesk Inventor. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:422-436 [Conf]
  30. Irit Katriel, Sven Thiel
    Fast Bound Consistency for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:437-451 [Conf]
  31. Ludwig Krippahl, Pedro Barahona
    Propagating N-Ary Rigid-Body Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:452-465 [Conf]
  32. Javier Larrosa, Enric Morancho
    Solving 'Still Life' with Soft Constraints and Bucket Elimination. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:466-479 [Conf]
  33. Christophe Lecoutre, Frédéric Boussemart, Fred Hemery
    Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:480-494 [Conf]
  34. Lengning Liu, Miroslaw Truszczynski
    Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:495-509 [Conf]
  35. Andrea Lodi, Michela Milano, Louis-Martin Rousseau
    Discrepancy-Based Additive Bounding for the AllDifferent Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:510-524 [Conf]
  36. Michael J. Maher
    A Synthesis of Constraint Satisfaction and Constraint Solving. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:525-539 [Conf]
  37. Laurent Michel, Pascal Van Hentenryck
    Maintaining Longest Paths Incrementally. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:540-554 [Conf]
  38. David G. Mitchell
    Resolution and Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:555-569 [Conf]
  39. Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabriella Cortellessa
    Generating High Quality Schedules for a Spacecraft Memory Downlink Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:570-584 [Conf]
  40. Jean-Francois Puget
    Symmetry Breaking Using Stabilizers. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:585-599 [Conf]
  41. Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, Sayyed Bashir Sadjad
    An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:600-614 [Conf]
  42. Stefan Ratschan
    Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:615-633 [Conf]
  43. Jean-Charles Régin
    Using Constraint Programming to Solve the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:634-648 [Conf]
  44. Mihaela Sabin, Eugene C. Freuder, Richard J. Wallace
    Greater Efficiency for Conditional Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:649-663 [Conf]
  45. T. K. Satish Kumar
    Incremental Computation of Resource-Envelopes in Producer-Consumer Models. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:664-678 [Conf]
  46. Meinolf Sellmann
    Approximated Consistency for Knapsack Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:679-693 [Conf]
  47. Meinolf Sellmann
    Cost-Based Filtering for Shorter Path Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:694-708 [Conf]
  48. Cyril Terrioux, Philippe Jégou
    Bounded Backtracking for the Valued Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:709-723 [Conf]
  49. Toby Walsh
    Consistency and Propagation with Multiset Constraints: A Formal Viewpoint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:724-738 [Conf]
  50. Armin Wolf
    Pruning while Sweeping over Task Intervals. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:739-753 [Conf]
  51. Lin Xu, Berthe Y. Choueiry
    Improving Backtrack Search for Solving the TCSP. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:754-768 [Conf]
  52. Neil Yorke-Smith, Carmen Gervet
    Certainty Closure: A Framework for Reliable Constraint Reasoning with Uncertainty. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:769-783 [Conf]
  53. Nicos Angelopoulos
    clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:784-788 [Conf]
  54. Christian Bessière, Pascal Van Hentenryck
    To Be or Not to Be ... a Global Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:789-794 [Conf]
  55. Sebastian Brand, Rosella Gennari, Maarten de Rijke
    Constraint Programming for Modelling and Solving Modal Satisfability. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:795-800 [Conf]
  56. Ismel Brito, Pedro Meseguer
    Distributed Forward Checking. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:801-806 [Conf]
  57. David A. Cohen
    A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:807-811 [Conf]
  58. Remi Coletta, Christian Bessière, Barry O'Sullivan, Eugene C. Freuder, Sarah O'Connell, Joël Quinqueton
    Semi-automatic Modeling by Constraint Acquisition. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:812-816 [Conf]
  59. Emilie Danna, Laurent Perron
    Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:817-821 [Conf]
  60. Carlos Eisenberg, Boi Faltings
    Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:822-826 [Conf]
  61. Antonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez
    Toy(FD): Sketch of Operational Semantics. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:827-831 [Conf]
  62. Jeremy Frank, Richard Dearden
    Scheduling in the Face of Uncertain Resource Consumption and Utility. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:832-836 [Conf]
  63. Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei
    Supertree Construction with Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:837-841 [Conf]
  64. Enrico Giunchiglia, Marco Maratea, Armando Tacchella
    (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:842-846 [Conf]
  65. Nuno Gomes, Zita A. Vale, Carlos Ramos
    Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:847-852 [Conf]
  66. Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic
    A Canonicity Test for Configuration. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:853-857 [Conf]
  67. Fabrizio Grandoni, Giuseppe F. Italiano
    Improved Algorithms for Max-restricted Path Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:858-862 [Conf]
  68. Alessio Guerri, Michela Milano
    CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:863-867 [Conf]
  69. Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu
    A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:868-872 [Conf]
  70. George Katsirelos, Fahiem Bacchus
    Unrestricted Nogood Recording in CSP Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:873-877 [Conf]
  71. François Laburthe
    Constraints over Ontologies. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:878-882 [Conf]
  72. François Laburthe, Yves Caseau
    Using Constraints for Exploring Catalogs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:883-888 [Conf]
  73. Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali
    Intermediate (Learned) Consistencies. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:889-893 [Conf]
  74. David Larkin
    Semi-independent Partitioning: A Method for Bounding the Solution to COP's. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:894-898 [Conf]
  75. Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham
    Boosting as a Metaphor for Algorithm Design. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:899-903 [Conf]
  76. Olivier Lhomme
    An Efficient Filtering Algorithm for Disjunction of Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:904-908 [Conf]
  77. Bertrand Neveu, Gilles Trombettoni
    INCOP: An Open Library for INcomplete Combinatorial OPtimization. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:909-913 [Conf]
  78. Seiichi Nishihara, Kazunori Mizuno, Kohsuke Nishihara
    A Composition Algorithm for Very Hard Graph 3-Colorability Instances. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:914-919 [Conf]
  79. Shuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura
    Efficient Represenation of Discrete Sets for Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:920-924 [Conf]
  80. Adrian Petcu, Boi Faltings
    Applying Interchangeability Techniques to the Distributed Breakout Algorithm. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:925-929 [Conf]
  81. Karen E. Petrie, Barbara M. Smith
    Symmetry Breaking in Graceful Graphs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:930-934 [Conf]
  82. Nicolas Prcovic
    Tree Local Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:935-939 [Conf]
  83. Steven David Prestwich, Desmond G. Higgins, Orla O'Sullivan
    A SAT-Based Approach to Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:940-944 [Conf]
  84. Igor Razgon, Amnon Meisels
    Maintaining Dominance Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:945-949 [Conf]
  85. Tuomas Sandholm
    Terminating Decision Algorithms Optimally. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:950-955 [Conf]
  86. Gilles Trombettoni, Marta Wilczkowiak
    Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:956-961 [Conf]
  87. Carlos Ansótegui
    A New Approach to Solving SAT-Encoded Binary CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:962- [Conf]
  88. Muhammed Basharu
    FeReRA: A Multi-agent Approach to Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:963- [Conf]
  89. Heikel Batnini, Michel Rueher
    Semantic Decomposition for Solving Distance Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:964-965 [Conf]
  90. Julien Bidot
    Using Constraint Programming and Simulation for Execution Monitoring and On-Line Rescheduling with Uncertainty. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:966- [Conf]
  91. Jlifi Boutheina, Khaled Ghédira
    On the Enhancement of the Informed Backtracking Algorithm. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:967- [Conf]
  92. Ole Boysen
    Extending CLP with Metaheuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:968- [Conf]
  93. Tom Carchrae
    Self Configuring Constraint Programming Systems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:969- [Conf]
  94. Moyra Duggan, Barry O'Sullivan, Eugene C. Freuder
    Interactive Tradeoff Generation. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:970- [Conf]
  95. Pierre Flener, Justin Pearson, Magnus Ågren
    Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:971- [Conf]
  96. James Gibbons
    Abstracting Constraints Using Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:972- [Conf]
  97. Diarmuid Glynn
    Sensitivity Analysis in CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:973- [Conf]
  98. Emmanuel Hebrard
    Solution Stability in Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:974- [Conf]
  99. Michael Heusch
    distn: An Euclidean Distance Global Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:975- [Conf]
  100. Alan Holland, Barry O'Sullivan
    Algorithmic Mechanism Design and Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:976- [Conf]
  101. Rémy-Robert Joseph, Peter Chan, Michael Hiroux, Georges Weil
    Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:977- [Conf]
  102. Jerome Kelleher, Barry O'Sullivan
    Optimising the Representation and Evaluation of Semiring Combination Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:978- [Conf]
  103. Zeynep Kiziltan
    Symmetry Breaking Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:979- [Conf]
  104. Ludovic Langevine
    Observation of Constraint Programs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:980- [Conf]
  105. Wojciech Legierski
    Search Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:981- [Conf]
  106. Chavalit Likitvivatanavong
    Exploiting Microstructure in CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:982- [Conf]
  107. James Little, Cormac Gebruers, Derek G. Bridge, Eugene C. Freuder
    Using Case-Based Reasoning to Write Constraint Programs. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:983- [Conf]
  108. Toni Mancini
    Reformulation Techniques for a Class of Permutation Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:984- [Conf]
  109. Iain McDonald
    NuSBDS: An Easy to Use Symmetry Breaking System. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:985- [Conf]
  110. Tomás Müller
    Interactivity in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:986- [Conf]
  111. Tomas Eric Nordlander, Ken N. Brown, Derek H. Sleeman
    Identifying Inconsistent CSPs by Relaxation. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:987- [Conf]
  112. Barry O'Callaghan, Eugene C. Freuder, Barry O'Sullivan
    Useful Explanations. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:988- [Conf]
  113. Sarah O'Connell, Barry O'Sullivan, Eugene C. Freuder
    Teacher and Learner Profiles for Constraint Acquisition. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:989- [Conf]
  114. Karen E. Petrie
    Comparison of Symmetry Breaking Methods. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:990- [Conf]
  115. Jordi Planes
    Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:991- [Conf]
  116. Colin Quirke
    Search for Mathematical Objects. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:992- [Conf]
  117. Guillaume Rochart
    Explanations for Global Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:993- [Conf]
  118. Andrew G. D. Rowley
    Watching Clauses in Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:994- [Conf]
  119. Hans Schlenker
    Distributed Constraint-Based Railway Simulation. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:995- [Conf]
  120. Daniel Sheridan
    Dynamic Step Size Adjustment in Iterative Deepening Search. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:996- [Conf]
  121. Paula Sturdy
    Learning Good Variable Orderings. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:997- [Conf]
  122. Ann Tighe, Finlay S. Smith, Gerard Lyons
    An Adaptive Controller for Real-Time Resolution of the Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:998- [Conf]
  123. Kristen Brent Venable
    alpha-Dynamic Controllability of Simple Temporal Problems with Preferences and Uncertainty. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:999- [Conf]
  124. Petr Vilím
    Computing Explanations for Global Scheduling Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:1000- [Conf]
  125. Huayue Wu, Peter van Beek
    Restart Strategies: Analysis and Simulation. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:1001- [Conf]
  126. Peter Zoeteweij
    OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:1002- [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