The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Hector Geffner
    Search and Inference in AI Planning. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:1-4 [Conf]
  2. Ian Horrocks
    OWL: A Description Logic Based Ontology Language. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:5-8 [Conf]
  3. Francesca Rossi
    Preference Reasoning. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:9-12 [Conf]
  4. Peter J. Stuckey, Maria J. García de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh
    The G12 Project: Mapping Solver Independent Models to Efficient Solutions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:13-16 [Conf]
  5. David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith
    Symmetry Definitions for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:17-31 [Conf]
  6. Roie Zivan, Amnon Meisels
    Dynamic Ordering for Asynchronous Backtracking on DisCSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:32-46 [Conf]
  7. Magnus Ågren, Pierre Flener, Justin Pearson
    Incremental Algorithms for Local Search from Existential Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:47-61 [Conf]
  8. Konstantin Artiouchine, Philippe Baptiste
    Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:62-76 [Conf]
  9. Heikel Batnini, Claude Michel, Michel Rueher
    Mind the Gaps: A New Splitting Strategy for Consistency Techniques. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:77-91 [Conf]
  10. Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet
    Graph Invariants as Necessary Conditions for Global Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:92-106 [Conf]
  11. Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano
    Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:107-121 [Conf]
  12. Russell Bent, Irit Katriel, Pascal Van Hentenryck
    Sub-optimality Approximations. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:122-136 [Conf]
  13. Hariolf Betz, Thom W. Frühwirth
    A Linear-Logic Semantics for Constraint Handling Rules. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:137-151 [Conf]
  14. Ismel Brito, Pedro Meseguer
    Distributed Stable Matching Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:152-166 [Conf]
  15. Hubie Chen, Víctor Dalmau
    Beyond Hypertree Width: Decomposition Methods Without Decompositions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:167-181 [Conf]
  16. Kenil C. K. Cheng, Roland H. C. Yap
    Ad-hoc Global Constraints for Life. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:182-195 [Conf]
  17. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:196-210 [Conf]
  18. Grégoire Dooms, Yves Deville, Pierre E. Dupont
    CP(Graph): Introducing a Graph Computation Domain in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:211-225 [Conf]
  19. Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier
    Interval Analysis in Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:226-240 [Conf]
  20. Felix Geller, Michael Veksler
    Assumption-Based Pruning in Conditional CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:241-255 [Conf]
  21. Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith
    Conditional Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:256-270 [Conf]
  22. Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
    Symmetry and Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:271-285 [Conf]
  23. Warwick Harvey, Thorsten Winterer
    Solving the MOLR and Social Golfers Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:286-300 [Conf]
  24. Laurent Henocque, Mathias Kleiner, Nicolas Prcovic
    Advances in Polytime Isomorph Elimination for Configuration. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:301-313 [Conf]
  25. John N. Hooker
    Planning and Scheduling to Minimize Tardiness. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:314-327 [Conf]
  26. Tudor Hulubei, Barry O'Sullivan
    Search Heuristics and Heavy-Tailed Behaviour. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:328-342 [Conf]
  27. Joey Hwang, David G. Mitchell
    2-Way vs. d-Way Branching for CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:343-357 [Conf]
  28. Irit Katriel, Pascal Van Hentenryck
    Maintaining Longest Paths in Cyclic Graphs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:358-372 [Conf]
  29. Ludwig Krippahl, Pedro Barahona
    Applying Constraint Programming to Rigid Body Protein Docking. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:373-387 [Conf]
  30. Andrei A. Krokhin, Benoit Larose
    Maximum Constraint Satisfaction on Diamonds. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:388-402 [Conf]
  31. Chu Li, Felip Manyà, Jordi Planes
    Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:403-414 [Conf]
  32. Hui Li 0002, Brian Williams
    Generalized Conflict Learning for Hybrid Discrete/Linear Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:415-429 [Conf]
  33. Laurent Michel, Pascal Van Hentenryck
    Parallel Local Search in Comet. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:430-444 [Conf]
  34. Barry O'Callaghan, Barry O'Sullivan, Eugene C. Freuder
    Generating Corrective Explanations for Interactive Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:445-459 [Conf]
  35. Gilles Pesant, Jean-Charles Régin
    SPREAD: A Balancing Constraint Based on Statistics. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:460-474 [Conf]
  36. Jean-Francois Puget
    Automatic Detection of Variable and Value Symmetries. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:475-489 [Conf]
  37. Jean-Francois Puget
    Breaking All Value Symmetries in Surjection Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:490-504 [Conf]
  38. Jean-Charles Régin
    AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:505-519 [Conf]
  39. Jean-Charles Régin
    Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:520-533 [Conf]
  40. Jochen Renz, Gérard Ligozat
    Weak Composition for Qualitative Spatial and Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:534-548 [Conf]
  41. Georg Ringwelski, Youssef Hamadi
    Boosting Distributed Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:549-562 [Conf]
  42. Emma Rollon, Javier Larrosa
    Depth-First Mini-Bucket Elimination. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:563-577 [Conf]
  43. Horst Samulowitz, Fahiem Bacchus
    Using SAT in QBF. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:578-592 [Conf]
  44. Martí Sánchez, Javier Larrosa, Pedro Meseguer
    Tree Decomposition with Function Filtering. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:593-606 [Conf]
  45. Hossein M. Sheini, Bart Peintner, Karem A. Sakallah, Martha E. Pollack
    On Solving Soft Temporal Constraints Using SAT Techniques. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:607-621 [Conf]
  46. Kish Shen, Joachim Schimpf
    Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:622-636 [Conf]
  47. Barbara M. Smith
    Caching Search States in Permutation Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:637-651 [Conf]
  48. Kostas Stergiou
    Repair-Based Methods for Quantified CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:652-666 [Conf]
  49. Michael Thielscher
    Handling Implication and Universal Quantification Constraints in FLUX. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:667-681 [Conf]
  50. Vincent Vidal, Hector Geffner
    Solving Simple Planning Problems with More Inference and No Search. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:682-696 [Conf]
  51. Benjamin W. Wah, Yixin Chen
    Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:697-711 [Conf]
  52. Richard Wallace
    Factor Analytic Studies of CSP Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:712-726 [Conf]
  53. Anbulagan, John K. Slaney
    Lookahead Saturation with Restriction for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:727-731 [Conf]
  54. Stuart Bain, John Thornton, Abdul Sattar
    Evolving Variable-Ordering Heuristics for Constrained Optimisation. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:732-736 [Conf]
  55. J. Beck
    Multi-point Constructive Search. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:737-741 [Conf]
  56. Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart
    Bounds of Graph Characteristics. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:742-746 [Conf]
  57. Christian Bessière, Remi Coletta, Thierry Petit
    Acquiring Parameters of Implied Global Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:747-751 [Conf]
  58. Hadrien Cambazard, Narendra Jussien
    Integrating Benders Decomposition Within Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:752-756 [Conf]
  59. Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais
    Using Boolean Constraint Propagation for Sub-clauses Deduction. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:757-761 [Conf]
  60. Bistra N. Dilkina, Lei Duan, William S. Havens
    Extending Systematic Local Search for Job Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:762-766 [Conf]
  61. Tarik Hadzic, Henrik Reif Andersen
    Interactive Reconfiguration in Power Supply Restoration. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:767-771 [Conf]
  62. Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, Duc Nghia Pham
    Neighbourhood Clause Weight Redistribution in Local Search for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:772-776 [Conf]
  63. Philippe Jégou, Samba Ndiaye, Cyril Terrioux
    Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:777-781 [Conf]
  64. Alexander Lazovik, Marco Aiello, Rosella Gennari
    Encoding Requests to Web Service Compositions as Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:782-786 [Conf]
  65. Mistuo Motoki
    Test Instance Generation for MAX 2SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:787-791 [Conf]
  66. Peter Nightingale
    Consistency for Quantified Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:792-796 [Conf]
  67. Laurent Perron
    Alternate Modeling in Sport Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:797-801 [Conf]
  68. Adrian Petcu, Boi Faltings
    Approximations in Distributed Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:802-806 [Conf]
  69. Nicolas Prcovic
    Extremal CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:807-811 [Conf]
  70. Claude-Guy Quimper, Toby Walsh
    Beyond Finite Domains: The All Different and Global Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:812-816 [Conf]
  71. Christian Schulte, Guido Tack
    Views and Iterators for Generic Constraint Implementations. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:817-821 [Conf]
  72. Meinolf Sellmann
    Approximated Consistency for the Automatic Recording Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:822-826 [Conf]
  73. Carsten Sinz
    Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:827-831 [Conf]
  74. Stéphane Zampelli, Yves Deville, Pierre E. Dupont
    Approximate Constrained Subgraph Matching. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:832-836 [Conf]
  75. Montserrat Abril, Miguel A. Salido, Federico Barber
    Distributed Constraints for Large-Scale Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:837- [Conf]
  76. Josep Argelich, Felip Manyà
    Solving Over-Constrained Problems with SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:838- [Conf]
  77. David A. Burke, Kenneth N. Brown
    A Constraint Based Agent for TAC-SCM. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:839- [Conf]
  78. Mihaela Butaru, Zineb Habbas
    Solving the Car-Sequencing Problem as a Non-binary CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:840- [Conf]
  79. Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouquard
    Dimensioning an Inbound Call Center Using Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:841- [Conf]
  80. Tom Carchrae, J. Christopher Beck, Eugene C. Freuder
    Methods to Learn Abstract Scheduling Models. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:842- [Conf]
  81. Pavel Cejnar, Roman Barták
    Automated Search for Heuristic Functions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:843- [Conf]
  82. Le Chang, Alan K. Mackworth
    Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:844- [Conf]
  83. Iván Dotú, Alvaro del Val, Pascal Van Hentenryck
    Scheduling Social Tournaments. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:845- [Conf]
  84. Latife Genç Kaya, John N. Hooker
    Domain Reduction for the Circuit Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:846- [Conf]
  85. Carlos Grandón, Bertrand Neveu
    Using Constraint Programming for Solving Distance CSP with Uncertainty. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:847- [Conf]
  86. Emmanuel Hebrard, Toby Walsh
    Improved Algorithm for Finding (a, b)-Super Solutions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:848- [Conf]
  87. Federico Heras, Javier Larrosa
    Local Consistency in Weighted CSPs and Inference in Max-SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:849- [Conf]
  88. Matthias Hoche, Stefan Jähnichen
    Modeling Constraint Programs with Software Technology Standards. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:850- [Conf]
  89. Chris Houghton, David A. Cohen
    Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:851- [Conf]
  90. Eric Hsu, Sheila A. McIlraith
    Mechanism Design for Preference Aggregation over Coalitions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:852- [Conf]
  91. Lucian Leahu, Carla P. Gomes
    LP as a Global Search Heuristic Across Different Constrainedness Regions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:853- [Conf]
  92. Andrei Legtchenko, Arnaud Lallouet
    Consistency for Partially Defined Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:854- [Conf]
  93. Cheuk Leung, Barry Richards, Olli Kamarainen
    Subnet Generation Problem: A New Network Routing Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:855- [Conf]
  94. Tiziana Ligorio, Susan L. Epstein
    Partial Redundant Modeling. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:856- [Conf]
  95. Radu Marinescu, Rina Dechter
    AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:857- [Conf]
  96. Roland Martin, Karsten Weihe
    Weak Symmetries in Problem Formulations. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:858- [Conf]
  97. Bernadette Martínez Hernández, Alan M. Frisch
    Towards the Systematic Generation of Channelling Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:859- [Conf]
  98. Robert Mateescu, Rina Dechter
    AND/OR Search Spaces and the Semantic Width of Constraint Networks. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:860- [Conf]
  99. Ramón Béjar, Cèsar Fernández, Carles Mateu
    Statistical Modelling of CSP Solving Algorithms Performance. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:861- [Conf]
  100. Deepak Mehta, Marc R. C. van Dongen
    Probabilistic Arc Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:862- [Conf]
  101. Henry Müller, Stefan Jähnichen
    GOOSE - A Generic Object-Oriented Search Environment. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:863- [Conf]
  102. Quang Nguyen, Boi Faltings
    Randomization for Multi-agent Constraint Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:864- [Conf]
  103. Maria Silvia Pini, Francesca Rossi
    Uncertainty in Soft Constraint Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:865- [Conf]
  104. Luis O. Quesada, Peter Van Roy, Yves Deville
    Speeding Up Constrained Path Solvers with a Reachability Propagator. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:866- [Conf]
  105. Claude-Guy Quimper, Alejandro López-Ortiz
    From Linear Relaxations to Global Constraint Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:867- [Conf]
  106. Pavel Surynek, Roman Barták
    Encoding HTN Planning as a Dynamic CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:868- [Conf]
  107. Chris Unsworth, Patrick Prosser
    Specialised Constraints for Stable Matching Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:869- [Conf]
  108. Stefania Verachi, Steven David Prestwich
    Bounds-Consistent Local Search. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:870- [Conf]
  109. Alfio Vidotto, Kenneth N. Brown, J. Beck
    Robust Constraint Solving Using Multiple Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:871- [Conf]
  110. Christine Wu, Kenneth N. Brown, J. Beck
    Scheduling with Uncertain Start Dates. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:872- [Conf]
  111. Honglei Zeng, Sheila A. McIlraith
    The Role of Redundant Clauses in Solving Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:873- [Conf]
  112. Yaling Zheng, Berthe Y. Choueiry
    Applying Decomposition Methods to Crossword Puzzle Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:874- [Conf]
  113. Roie Zivan, Amnon Meisels
    Asymmetric Distributed Constraints Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:875- [Conf]
  114. Josef Zlomek, Roman Barták
    Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:876- [Conf]
  115. Alexander Brodsky, Hadon Nash
    CoJava: A Unified Language for Simulation and Optimization. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:877-877 [Conf]
  116. Antonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez
    Programming with TOY(FD). [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:878-878 [Conf]
  117. Emmanuel Hebrard, Paul Tyler, Toby Walsh
    Computing Super-Schedules. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:879-879 [Conf]
  118. András Kovács, Péter Egri, Tamás Kis, József Váncza
    Proterv-II: An Integrated Production Planning and Scheduling System. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:880-880 [Conf]
  119. Laurent Michel, Pascal Van Hentenryck
    The Comet Programming Language and System. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:881-881 [Conf]
  120. Yehuda Naveh, Roy Emek
    Random Stimuli Generation for Functional Hardware Verification as a CP Application. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:882-882 [Conf]
  121. Erik Meer
    A BDD-Based Interactive Configurator for Modular Systems. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:883-883 [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