Carles Mateu

J. Netw. Comput. Appl., 2020

HYDRA: A multimodal deep learning framework for malware classification.

[BibT_eX]

[DOI]

Comput. Secur., 2020

Orthrus: A Bimodal Learning Architecture for Malware Classification.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019

Using convolutional neural networks for classification of malware represented as images.

[BibT_eX]

[DOI]

J. Comput. Virol. Hacking Tech., 2019

A Hierarchical Convolutional Neural Network for Malware Classification.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2019

An Android Malware Detection Framework Using Graph Embeddings and Convolutional Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2019

2018

An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2018

An End-to-End Deep Learning Architecture for Classification of Malware's Binary Content.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2018, 2018

Classification of Malware by Using Structural Entropy on Convolutional Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Weighted argumentation for analysis of discussions in Twitter.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2017

Convolutional Neural Networks for Classification of Malware Assembly Code.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017

2016

A predictor model for the composting process on an industrial scale based on Markov processes.

[BibT_eX]

[DOI]

Environ. Model. Softw., 2016

On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2016

Support Analysis of Weighted Discussions in Twitter.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2016

2015

Approximate dynamic programming for automated vacuum waste collection systems.

[BibT_eX]

[DOI]

Environ. Model. Softw., 2015

Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.

[BibT_eX]

[DOI]

AI Commun., 2015

2014

Modeling energy consumption in automated vacuum waste collection systems.

[BibT_eX]

[DOI]

Environ. Model. Softw., 2014

2013

On the hardness of solving edge matching puzzles as SAT or CSP problems.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2013

2012

The Sudoku completion problem with rectangular hole pattern is NP-complete.

[BibT_eX]

[DOI]

Discret. Math., 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

The Automated Vacuum Waste Collection Optimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Generating highly balanced sudoku problems as hard problems.

[BibT_eX]

[DOI]

J. Heuristics, 2011

Towards an Efficient Use of Resources in All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2011

On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2011

2010

Solving Pseudo-Boolean Modularity Constraints.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

2009

CSP problems as algorithmic benchmarks: measures, methods and models.

[BibT_eX]

[DOI]

PhD thesis, 2009

Bounding the Phase Transition on Edge Matching Puzzles.

[BibT_eX]

[DOI]

Proceedings of the ISMVL 2009, 2009

2008

Hard SAT and CSP instances with Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Edge Matching Puzzles as Hard SAT/CSP Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

From High Girth Graphs to Hard Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

How Hard is a Commercial Puzzle: the Eternity II Challenge.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2008

Generating Hard SAT/CSP Instances Using Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

On Balanced CSPs with High Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

The Impact of Balancing on Problem Hardness in a Highly Structured Domain.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Statistical Modelling of CSP Solving Algorithms Performance.

[BibT_eX]

[DOI]

Ramón Béjar

Cèsar Fernández