Skip to main content

and
  1. Article

    Open Access

    Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis

    The automated analysis of different trends in online debating forums is an interesting tool for sampling the agreement between citizens in different topics. In previous work, we have defined computational mode...

    Teresa Alsinet, Josep Argelich, Ramón Béjar in International Journal of Computational Int… (2022)

  2. No Access

    Article

    Using convolutional neural networks for classification of malware represented as images

    The number of malicious files detected every year are counted by millions. One of the main reasons for these high volumes of different files is the fact that, in order to evade detection, malware authors add m...

    Daniel Gibert, Carles Mateu, Jordi Planes in Journal of Computer Virology and Hacking T… (2019)

  3. Article

    Open Access

    Blacklist muti-objective genetic algorithm for energy saving in heterogeneous environments

    Reducing energy consumption in large-scale computing facilities has become a major concern in recent years. Most of the techniques have focused on determining the computing requirements based on load predictio...

    Eloi Gabaldon, Josep Lluis Lerida, Fernando Guirado in The Journal of Supercomputing (2017)

  4. No Access

    Article

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

    We analyze and compare two solvers for Boolean optimization problems: WMaxSatz, a solver for Partial MaxSAT, and MinSatz, a solver for Partial MinSAT. Both MaxSAT and MinSAT are similar, but previous results i...

    Josep Argelich, Ramón Béjar, Cèsar Fernández in Annals of Mathematics and Artificial Intel… (2016)

  5. No Access

    Article

    Iterative and core-guided MaxSAT solving: A survey and assessment

    Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real world applications can be naturally encoded as such. Solving MaxSAT is an important problem from both a theoretica...

    Antonio Morgado, Federico Heras, Mark Liffiton, Jordi Planes in Constraints (2013)

  6. No Access

    Article

    Resolution-based lower bounds in MaxSAT

    The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a competitive solver. In modern solvers like MaxSatz and MiniMaxSat, the LB relies on the cooperation of the undere...

    Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes in Constraints (2010)

  7. No Access

    Article

    An efficient solver for weighted Max-SAT

    We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental e...

    Teresa Alsinet, Felip Manyà, Jordi Planes in Journal of Global Optimization (2008)