Renato Bruni

According to our database1, Renato Bruni authored at least 24 papers between 2000 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Anticipating epileptic seizures through the analysis of EEG synchronization as a data classification problem.
CoRR, 2018

2017
A Robust Optimization Approach for Magnetic Spacecraft Attitude Stabilization.
J. Optimization Theory and Applications, 2017

On exact and approximate stochastic dominance strategies for portfolio selection.
European Journal of Operational Research, 2017

2016
A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas.
Optimization Letters, 2016

ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors.
Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

2015
Effective Classification Using a Small Training Set Based on Discretization and Statistical Analysis.
IEEE Trans. Knowl. Data Eng., 2015

2014
Balancing of agricultural census data by using discrete optimization.
Optimization Letters, 2014

2011
Complete and Exact Peptide Sequence Analysis Based on Propositional Logic.
Proceedings of the Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 2011

2010
A Logic-Based Approach to Polymer Sequence Analysis.
J. Math. Model. Algorithms, 2010

2008
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability.
Discrete Optimization, 2008

Solving peptide sequencing as satisfiability.
Computers & Mathematics with Applications, 2008

A Combinatorial Optimization Approach for Determining Composition and Sequence of Polymers.
Algorithmic Operations Research, 2008

2007
Reformulation of the support set selection problem in the logical analysis of data.
Annals OR, 2007

2005
Error correction for massive datasets.
Optimization Methods and Software, 2005

On the orthogonalization of arbitrary Boolean formulae.
JAMDS, 2005

On exact selection of minimally unsatisfiable subformulae.
Ann. Math. Artif. Intell., 2005

2004
Discrete models for data imputation.
Discrete Applied Mathematics, 2004

Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers.
Proceedings of the SAT 2004, 2004

2003
A Complete Adaptive Algorithm for Propositional Satisfiability.
Discrete Applied Mathematics, 2003

Approximating minimal unsatisfiable subformulae by means of adaptive core search.
Discrete Applied Mathematics, 2003

Solving Error Correction for Large Data Sets by Means of a SAT Solver.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2001
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.
Electronic Notes in Discrete Mathematics, 2001

Errors Detection and Correction in Large Scale Data Collecting.
Proceedings of the Advances in Intelligent Data Analysis, 4th International Conference, 2001

2000
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2000


  Loading...