8 citations · 23 across the 8 of their papers we have counts for
9 papers
On the flow matching interpretability
Francesco Pivi, Simone Gazza, Davide Evangelista +2
Generative models based on flow matching have demonstrated remarkable success in various domains, yet they suffer from a fundamental limitation: the lack of interpretability in the…
On the evaluation of (meta-)solver approaches
Roberto Amadini, Maurizio Gabbrielli, Tong Liu +1
Meta-solver approaches exploits a number of individual solvers to potentially build a better solver. To assess the performance of meta-solvers, one can simply adopt the metrics typ…
sunny-as2: Enhancing SUNNY for Algorithm Selection
Tong Liu, Roberto Amadini, Jacopo Mauro +1
SUNNY is an Algorithm Selection (AS) technique originally tailored for Constraint Programming (CP). SUNNY enables to schedule, from a portfolio of solvers, a subset of solvers to b…
A Survey on String Constraint Solving
Roberto Amadini
String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the last years gi…
SUNNY-CP and the MiniZinc Challenge
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
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 significant…
MiniZinc with Strings
Roberto Amadini, Pierre Flener, Justin Pearson +3
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analys…
A Multicore Tool for Constraint Solving
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (CP), a portfolio solver uses a variety of different solvers for solving a given Constraint Satisfaction / Opt…
An Enhanced Features Extractor for a Portfolio of Constraint Solvers
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
Recent research has shown that a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. The solver selection is…
An Empirical Evaluation of Portfolios Approaches for solving CSPs
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperform…