Andrea Visentin

Orcid: 0000-0003-3702-4826

According to our database1, Andrea Visentin authored at least 18 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimizing Quantile-based Trading Strategies in Electricity Arbitrage.
CoRR, 2024

Electricity Price Forecasting in the Irish Balancing Market.
CoRR, 2024

AI-Based Task Classification With Pressure Insoles for Occupational Safety.
IEEE Access, 2024

Explainable Algorithm Selection for the Capacitated Lot Sizing Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2023
Stochastic dynamic programming heuristic for the (R,s,S) policy parameters computation.
Comput. Oper. Res., October, 2023

Uncertainty-Aware Workload Prediction in Cloud Computing.
CoRR, 2023

SAT Feature Analysis for Machine Learning Classification Tasks.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Using Machine Learning Classifiers in SAT Branching [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Performance and Energy Savings Trade-Off with Uncertainty-Aware Cloud Workload Forecasting.
Proceedings of the 31st IEEE International Conference on Network Protocols, 2023

Clustering-Based Numerosity Reduction for Cloud Workload Forecasting.
Proceedings of the Algorithmic Aspects of Cloud Computing - 8th International Symposium, 2023

2022
SATfeatPy - A Python-based Feature Extraction System for Satisfiability.
CoRR, 2022

Bayesian Uncertainty Modelling for Cloud Workload Prediction.
Proceedings of the IEEE 15th International Conference on Cloud Computing, 2022

2021
Computing optimal (R, s, S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming.
Eur. J. Oper. Res., 2021

Automated SAT Problem Feature Extraction using Convolutional Autoencoders.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

2019
Modelling Dynamic Programming-Based Global Constraints in Constraint Programming.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Predicting Judicial Decisions: A Statistically Rigorous Approach and a New Ensemble Classifier.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

2018
Towards a Closer Integration of Dynamic Programming and Constraint Programming.
Proceedings of the GCAI-2018, 2018

2016
Robust Principal Component Analysis by Reverse Iterative Linear Programming.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016


  Loading...