Search Results for author:
Found 10 papers, 3 papers with code
Multimodal Side-Tuning for Document Classification
In this paper, we propose to exploit the side-tuning framework for multimodal document classification.
Ranked #4 on
Document Image Classification
on Tobacco-3482
On the evaluation of (meta-)solver approaches
Meta-solver approaches exploits a number of individual solvers to potentially build a better solver.
Content-Based Textual File Type Detection at Scale
Doing so is helpful to classify source code that lack file extensions (e. g., code snippets posted on the Web or executable scripts), to avoid misclassifying source code that has been recorded with wrong or uncommon file extensions, and also shed some light on the intrinsic recognizability of source code files.
sunny-as2: Enhancing SUNNY for Algorithm Selection
A preliminary version of sunny-as2 was submitted to the Open Algorithm Selection Challenge (OASC) in 2017, where it turned out to be the best approach for the runtime minimization of decision problems.
SUNNY-CP and the MiniZinc Challenge
In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem.
A Multicore Tool for Constraint Solving
*** 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 / Optimization Problem.
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties.
SUNNY: a Lazy Portfolio Approach for Constraint Solving
In this paper we present SUNNY: a simple and flexible algorithm that takes advantage of a portfolio of constraint solvers in order to compute --- without learning an explicit model --- a schedule of them for solving a given Constraint Satisfaction Problem (CSP).
An Enhanced Features Extractor for a Portfolio of Constraint Solvers
Recent research has shown that a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers.
An Empirical Evaluation of Portfolios Approaches for solving CSPs
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 outperformed by a portfolio of possibly slower on-average solvers.
