Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

SUNNY-CP and the MiniZinc Challenge (1706.08627v3)

Published 26 Jun 2017 in cs.AI

Abstract: In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc Challenge---the annual international competition for CP solvers---where it won two gold medals in 2015 and 2016. Under consideration in Theory and Practice of Logic Programming (TPLP)

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Roberto Amadini (9 papers)
  2. Maurizio Gabbrielli (26 papers)
  3. Jacopo Mauro (24 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.