default search action
Roberto Amadini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Monica Vitali, Jacopo Soldani, Roberto Amadini, Antonio Brogi, Stefano Forti, Simone Gazza, Saverio Giallorenzo, Pierluigi Plebani, Francisco Ponce, Gianluigi Zavattaro:
FREEDA: Failure-Resilient, Energy-aware, and Explainable Deployment of Microservice-based Applications over Cloud-IoT Infrastructures. CAiSE Research Projects Exhibition 2024: 69-75 - [c26]Jacopo Soldani
, Roberto Amadini
Towards Sustainable Deployment of Microservices over the Cloud-IoT Continuum, with FREEDA. FRAME@HPDC 2024 - [c25]Roberto Amadini
Pick a Flavour: Towards Sustainable Deployment of Cloud-Edge Applications. LOPSTR 2024: 117-127 - 2023
- [j12]Roberto Amadini:
A Survey on String Constraint Solving. ACM Comput. Surv. 55(2): 16:1-16:38 (2023) - [j11]Roberto Amadini, Maurizio Gabbrielli, Tong Liu, Jacopo Mauro
On the Evaluation of (Meta-)solver Approaches. J. Artif. Intell. Res. 76: 705-719 (2023) - [c24]Roberto Amadini, Peter J. Stuckey:
A Regular Matching Constraint for String Variables. IJCAI 2023: 1868-1875 - 2022
- [c23]Tong Liu, Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
sunny-as2: Enhancing SUNNY for Algorithm Selection (Extended Abstract). IJCAI 2022: 5752-5756 - [i10]Roberto Amadini, Maurizio Gabbrielli, Tong Liu, Jacopo Mauro:
On the evaluation of (meta-)solver approaches. CoRR abs/2202.08613 (2022) - 2021
- [j10]Tong Liu, Roberto Amadini, Maurizio Gabbrielli
sunny-as2: Enhancing SUNNY for Algorithm Selection. J. Artif. Intell. Res. 72: 329-376 (2021) - 2020
- [j9]Roberto Amadini
Dashed strings for string constraint solving. Artif. Intell. 289: 103368 (2020) - [c22]Roberto Amadini, Graeme Gange, Peter Schachte, Harald Søndergaard
Abstract Interpretation, Symbolic Execution and Constraints. Gabbrielli's Festschrift 2020: 7:1-7:19 - [c21]Roberto Amadini
Dashed Strings and the Replace(-all) Constraint. CP 2020: 3-20 - [c20]Roberto Amadini, Graeme Gange, Peter Schachte
String Constraint Solving: Past, Present and Future. ECAI 2020: 2875-2876 - [c19]Roberto Amadini, Graeme Gange, Peter Schachte, Harald Søndergaard
Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study. LOPSTR 2020: 192-209 - [i9]Roberto Amadini:
A Survey on String Constraint Solving. CoRR abs/2002.02376 (2020) - [i8]Tong Liu, Roberto Amadini, Jacopo Mauro, Maurizio Gabbrielli:
sunny-as2: Enhancing SUNNY for Algorithm Selection. CoRR abs/2009.03107 (2020)
2010 – 2019
- 2019
- [c18]Roberto Amadini, Mak Andrlon
Constraint Programming for Dynamic Symbolic Execution of JavaScript. CPAIOR 2019: 1-19 - 2018
- [j8]Roberto Amadini, Graeme Gange, François Gauthier, Alexander Jordan
Reference Abstract Domains and Applications to String Analysis. Fundam. Informaticae 158(4): 297-326 (2018) - [j7]Roberto Amadini, Maurizio Gabbrielli
SUNNY-CP and the MiniZinc challenge. Theory Pract. Log. Program. 18(1): 81-96 (2018) - [c17]Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Sweep-Based Propagation for String Constraint Solving. AAAI 2018: 6557-6564 - [c16]Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Propagating Regular Membership with Dashed Strings. CP 2018: 13-29 - [c15]Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Propagating lex, find and replace with Dashed Strings. CPAIOR 2018: 18-34 - 2017
- [c14]Roberto Amadini, Graeme Gange, Peter J. Stuckey
A Novel Approach to String Constraint Solving. CP 2017: 3-20 - [c13]Roberto Amadini, Alexander Jordan
Combining String Abstract Domains for JavaScript Analysis: An Evaluation. TACAS (1) 2017: 41-57 - [i7]Tong Liu
SUNNY with Algorithm Configuration. OASC 2017: 12-14 - [i6]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
SUNNY-CP and the MiniZinc Challenge. CoRR abs/1706.08627 (2017) - 2016
- [j6]Roberto Amadini
Portfolio approaches for constraint optimization problems. Ann. Math. Artif. Intell. 76(1-2): 229-246 (2016) - [j5]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems. Int. J. Interact. Multim. Artif. Intell. 3(7): 81-86 (2016) - [c12]Roberto Amadini, Maurizio Gabbrielli
Parallelizing Constraint Solvers for Hard RCPSP Instances. LION 2016: 227-233 - [c11]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey
MiniZinc with Strings. LOPSTR 2016: 59-75 - [i5]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack:
MiniZinc with Strings. CoRR abs/1608.03650 (2016) - 2015
- [b1]Roberto Amadini:
Portfolio Approaches in Constraint Programming. (Portfolio approches dans la Programmation par contraintes). University of Bologna, Italy, 2015 - [j4]Roberto Amadini:
Portfolio approaches in constraint programming. Constraints An Int. J. 20(4): 483 (2015) - [c10]Roberto Amadini, Fabio Biselli, Maurizio Gabbrielli, Tong Liu
SUNNY for algorithm selection: a preliminary study. CILC 2015: 202-206 - [c9]Roberto Amadini, Fabio Biselli, Maurizio Gabbrielli
Feature Selection for SUNNY: A Study on the Algorithm Selection Library. ICTAI 2015: 25-32 - [c8]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
A Multicore Tool for Constraint Solving. IJCAI 2015: 232-238 - [c7]Roberto Amadini, Maurizio Gabbrielli
Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges. LOPSTR 2015: 349-364 - [c6]Roberto Amadini
SUNNY-CP: a sequential CP portfolio solver. SAC 2015: 1861-1867 - [i4]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
SUNNY-CP 2: a Parallel CP Portfolio Solver. CoRR abs/1502.03986 (2015) - 2014
- [j3]Roberto Amadini
SUNNY: a Lazy Portfolio Approach for Constraint Solving. Theory Pract. Log. Program. 14(4-5): 509-524 (2014) - [c5]Roberto Amadini
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers. CP 2014: 108-124 - [c4]Roberto Amadini
Portfolio Approaches for Constraint Optimization Problems. LION 2014: 21-35 - [c3]Roberto Amadini
An enhanced features extractor for a portfolio of constraint solvers. SAC 2014: 1357-1359 - 2013
- [j2]Roberto Amadini
A Constraint-Based Model for Fast Post-Disaster Emergency Vehicle Routing. Int. J. Interact. Multim. Artif. Intell. 2(4): 67-75 (2013) - [j1]Roberto Amadini:
Evaluation and Application of Portfolio Approaches in Constraint Programming. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c2]Roberto Amadini
An Empirical Evaluation of Portfolios Approaches for Solving CSPs. CPAIOR 2013: 316-324 - [c1]Roberto Amadini
Fast Post-Disaster Emergency Vehicle Scheduling. DCAI 2013: 219-226 - [i3]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
Features for Building CSP Portfolio Solvers. CoRR abs/1308.0227 (2013) - [i2]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
SUNNY: a Simple and Dynamic Algorithm Portfolio for Solving CSPs. CoRR abs/1311.3353 (2013) - 2012
- [i1]Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
An Empirical Evaluation of Portfolios Approaches for solving CSPs. CoRR abs/1212.0692 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 19:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: