Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

SUNNY-CP : a Sequential CP Portfolio Solver

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      Department of Computer Science and Engineering Bologna (DISI); Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO); Foundations of Component-based Ubiquitous Systems (FOCUS); Inria Sophia Antipolis - Méditerranée (CRISAM); Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
    • بيانات النشر:
      HAL CCSD
    • الموضوع:
      2015
    • Collection:
      HAL Université Côte d'Azur
    • الموضوع:
      Salamanca; Spain
    • نبذة مختصرة :
      International audience ; The Constraint Programming (CP) paradigm allows to model and solve Constraint Satisfaction / Optimization Problems (CSPs / COPs). A CP Portfolio Solver is a particular constraint solver that takes advantage of a portfolio of different CP solvers in order to solve a given problem by properly exploiting Algorithm Selection techniques. In this work we present sunny-cp: a CP portfolio for solving both CSPs and COPs that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.
    • الرقم المعرف:
      10.1145/2695664.2695741
    • الدخول الالكتروني :
      https://inria.hal.science/hal-01227589
      https://inria.hal.science/hal-01227589v1/document
      https://inria.hal.science/hal-01227589v1/file/sac_2015%20%281%29.pdf
      https://doi.org/10.1145/2695664.2695741
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.3F73404F