The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Michela Milano, Willem Jan van Hoeve
    Reduced Cost-Based Ranking for Generating Promising Subproblems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:1-16 [Conf]
  2. Gautam Appa, Ioannis Mourtos, Dimitris Magos
    Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:17-32 [Conf]
  3. Paula Amaral, Pedro Barahona
    On Optimal Correction of Inconsistent Linear Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:33-46 [Conf]
  4. Yannis Dimopoulos, Alfonso Gerevini
    Temporal Planning through Mixed Integer Programming: A Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:47-62 [Conf]
  5. Nicolas Beldiceanu, Mats Carlsson
    A New Multi-resource cumulatives Constraint with Negative Heights. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:63-79 [Conf]
  6. Tallys H. Yunes
    On the Sum Constraint: Relaxation and Applications. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:80-92 [Conf]
  7. Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh
    Global Constraints for Lexicographic Orderings. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:93-108 [Conf]
  8. Yahia Lebbah, Michel Rueher, Claude Michel
    A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:109-123 [Conf]
  9. Vincent A. Cicirello, Stephen F. Smith
    Amplification of Search Performance through Randomization of Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:124-138 [Conf]
  10. Nicola Muscettola
    Computing the Envelope for Stepwise-Constant Resource Allocations. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:139-154 [Conf]
  11. Olli Kamarainen, Hani El Sakkout
    Local Probing Applied to Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:155-171 [Conf]
  12. Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez
    A Hybrid Approach for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:172-184 [Conf]
  13. Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais
    Recovering and Exploiting Structural Knowledge from CNF Formulas. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:185-199 [Conf]
  14. Lintao Zhang, Sharad Malik
    Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:200-215 [Conf]
  15. Wei Wei, Bart Selman
    Accelerating Random Walks. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:216-232 [Conf]
  16. Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos
    Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:233-248 [Conf]
  17. Francesca Rossi, Alessandro Sperduti, Kristen Brent Venable, Lina Khatib, Paul H. Morris, Robert A. Morris
    Learning and Solving Soft Temporal Constraints: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:249-263 [Conf]
  18. Pedro Meseguer, Martí Sánchez, Gérard Verfaillie
    Opportunistic Specialization in Russian Doll Search. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:264-279 [Conf]
  19. Thierry Petit, Jean-Charles Régin, Christian Bessière
    Range-Based Algorithm for Max-CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:280-294 [Conf]
  20. David G. Mitchell
    Resolution Complexity of Random Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:295-309 [Conf]
  21. Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi
    Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:310-326 [Conf]
  22. Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper
    Determining the Number of Solutions to Binary CSP Instances. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:327-340 [Conf]
  23. Spiros Skiadopoulos, Manolis Koubarakis
    Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:341-355 [Conf]
  24. Boi Faltings, Santiago Macho-Gonzalez
    Open Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:356-370 [Conf]
  25. Lucas Bordeaux, Eric Monfroy
    Beyond NP: Arc-Consistency for Quantified Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:371-386 [Conf]
  26. Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama
    Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:387-401 [Conf]
  27. Barbara M. Smith
    A Dual Graph Translation of a Problem in 'Life'. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:402-414 [Conf]
  28. Ian P. Gent, Warwick Harvey, Tom Kelsey
    Groups and Constraints: Symmetry Breaking during Search. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:415-430 [Conf]
  29. Iain McDonald, Barbara M. Smith
    Partial Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:431-445 [Conf]
  30. Jean-Francois Puget
    Symmetry Breaking Revisited. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:446-461 [Conf]
  31. Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh
    Breaking Row and Column Symmetries in Matrix Models. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:462-476 [Conf]
  32. Nicolas Barnier, Pascal Brisset
    Solving the Kirkman's Schoolgirl Problem in a Few Seconds. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:477-491 [Conf]
  33. David Lesaint
    Inferring Constraint Types in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:492-507 [Conf]
  34. Brian C. Williams, Michel D. Ingham
    Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:508-524 [Conf]
  35. Susan L. Epstein, Eugene C. Freuder, Richard J. Wallace, Anton Morozov, Bruce Samuels
    The Adaptive Constraint Engine. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:525-542 [Conf]
  36. Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin
    Indexical-Based Solver Learning. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:541-555 [Conf]
  37. Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham
    Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:556-572 [Conf]
  38. Yongshao Ruan, Eric Horvitz, Henry A. Kautz
    Restart Policies with Dependence among Runs: A Dynamic Programming Approach. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:573-586 [Conf]
  39. Roman Barták
    Visopt ShopFloor: On the Edge of Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:587-602 [Conf]
  40. Thierry Benoist, Etienne Gaudin, Benoît Rottembourg
    Constraint Programming Contribution to Benders Decomposition: A Case Study. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:603-617 [Conf]
  41. Marc Christie, Eric Languénou, Laurent Granvilliers
    Modeling Camera Control with Constrained Hypertubes. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:618-632 [Conf]
  42. Claude Le Pape, Laurent Perron, Jean-Charles Régin, Paul Shaw
    Robust and Parallel Solving of a Network Design Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:633-648 [Conf]
  43. Muriel Lauvergne, Philippe David, Patrice Boizumault
    Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:649-663 [Conf]
  44. Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes
    Communication and Computation in Distributed CSP Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:664-679 [Conf]
  45. Stefan Ratschan
    Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:680-685 [Conf]
  46. John N. Hooker, Hong Yan
    A Relaxation of the Cumulative Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:686-690 [Conf]
  47. Peter J. Stuckey, Lei Zheng
    Improving GSAT Using 2SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:691-695 [Conf]
  48. Jakob Mauss, Frank Seelisch, Mugur M. Tatar
    A Relational Constraint Solver for Model-Based Engineering. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:696-701 [Conf]
  49. Abdallah Elkhyari, Christelle Guéret, Narendra Jussien
    Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:702-707 [Conf]
  50. Andrew J. Parkes
    Scaling Properties of Pure Random Walk on Random 3-SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:708-713 [Conf]
  51. Andrea Roli
    Criticality and Parallelism in Structured SAT Instances. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:714-719 [Conf]
  52. Hachemi Bennaceur, Chu Min Li
    Characterizing SAT Problems with the Row Convexity Property. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:720-725 [Conf]
  53. Stefano Bistarelli, Boi Faltings, Nicoleta Neagu
    Interchangeability in Soft CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:726-731 [Conf]
  54. Neil Yorke-Smith, Carmen Gervet
    On Constraint Problems with Incompleteor Erroneous Data. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:732-737 [Conf]
  55. Meinolf Sellmann, Warwick Harvey
    Heuristic Constraint Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:738-743 [Conf]
  56. Meinolf Sellmann
    An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:744-749 [Conf]
  57. Yat Chiu Law, Jimmy Ho-Man Lee
    Algebraic Properties of CSP Model Operators. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:750-754 [Conf]
  58. Marc R. C. van Dongen
    AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:755-760 [Conf]
  59. Georg Ringwelski
    Integrating Search Objects in Asynchronous Constraint Solving. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:761- [Conf]
  60. Hans Schlenker
    Distributed Constraint-Based Railway Simulation. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:762- [Conf]
  61. Karen E. Petrie
    Symmetry Breaking in Peaceably Coexisting Armies of Queens. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:763- [Conf]
  62. Petr Vilím
    Batch Processing with Sequence Dependent Setup Times. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:764- [Conf]
  63. Tomás Müller
    Interactive Heuristic Search Algorithm. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:765- [Conf]
  64. Neil Yorke-Smith
    On Constraint Problems with Incomplete or Erroneous Data. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:766- [Conf]
  65. Andrea Roli
    Design of a New Metaheuristic for MAXSAT Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:767- [Conf]
  66. Miguel A. Salido, Federico Barber
    Disjunctive and Continuous Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:768- [Conf]
  67. Inês Lynce, João P. Marques Silva
    Tuning Randomization in Backtrack Search SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:769- [Conf]
  68. Yuan Zhan
    Constraint Solving in Test-Data Generation. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:770-771 [Conf]
  69. Markus Bohlin
    Improving Cost Calculations for Global Constraints in Local Search. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:772- [Conf]
  70. Gerrit Renker
    A Modeling Framework for Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:773-774 [Conf]
  71. Linda van Norden, Hans van Maaren
    A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:775-776 [Conf]
  72. Luis O. Quesada, Peter Van Roy
    A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:777- [Conf]
  73. Mattias Grönkvist
    Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:778- [Conf]
  74. Kristen B. Venable
    Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:779- [Conf]
  75. Frank Seelisch
    A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:780- [Conf]
  76. Brahim Hnich, Toby Walsh
    Models of Injection Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:781- [Conf]
  77. Iain McDonald
    Partial Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:782- [Conf]
  78. Lyndon Drake, Alan M. Frisch, Toby Walsh
    Automatic Generation of Implied Clauses for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:783- [Conf]
  79. Carlos Ansótegui, Felip Manyà
    Bridging the Gap between SAT and CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:784-785 [Conf]
  80. Zeynep Kiziltan
    Reducing Symmetry in Matrix Models. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:786- [Conf]
  81. Nicoleta Neagu
    Studying Interchangeability in Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:787-788 [Conf]
  82. Robert Glaubius, Berthe Y. Choueiry
    Constraint Modeling in the Context of Academic Task Assignment. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:789- [Conf]
  83. Ioannis A. Vetsikas
    Design Tradeoffs for Autonomous Trading Agents. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:790-792 [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