Publicaciones en colaboración con investigadoras/es de Ikerbasque, Fundación Vasca para la Ciencia (18)

2024

  1. Reinforcement learning for the optimization and online control of emulsion polymerization reactors: Particle morphology

    Computers and Chemical Engineering, Vol. 187

2023

  1. Minimax Forward and Backward Learning of Evolving Tasks with Performance Guarantees

    Advances in Neural Information Processing Systems

2022

  1. Author Correction: Informative neural representations of unseen contents during higher-order processing in human brains and deep artificial networks (Nature Human Behaviour, (2022), 6, 5, (720-731), 10.1038/s41562-021-01274-7)

    Nature Human Behaviour

  2. Informative neural representations of unseen contents during higher-order processing in human brains and deep artificial networks

    Nature Human Behaviour, Vol. 6, Núm. 5, pp. 720-731

  3. Minimax Classification under Concept Drift with Multidimensional Adaptation and Performance Guarantees

    Proceedings of Machine Learning Research

2021

  1. Ideafix: A decision tree-based method for the refinement of variants in FFPE DNA sequencing data

    NAR Genomics and Bioinformatics, Vol. 3, Núm. 4

  2. Probabilistic Load Forecasting Based on Adaptive Online Learning

    IEEE Transactions on Power Systems, Vol. 36, Núm. 4, pp. 3668-3680

2020

  1. Decoding and encoding models reveal the role of mental simulation in the brain representation of meaning

    Royal Society Open Science, Vol. 7, Núm. 5

2016

  1. Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

    Computers and Operations Research, Vol. 68, pp. 75-88

2015

  1. A matheuristic for the minimum weight rooted arborescence problem

    Journal of Heuristics, Vol. 21, Núm. 4, pp. 479-499

  2. An artificial bioindicator system for network intrusion detection

    Artificial Life, Vol. 21, Núm. 2, pp. 93-118

  3. FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs

    Swarm Intelligence, Vol. 9, Núm. 2-3, pp. 205-227

  4. Mathematical programming strategies for solving the minimum common string partition problem

    European Journal of Operational Research, Vol. 242, Núm. 3, pp. 769-777

2014

  1. Beam-ACO for the repetition-free longest common subsequence problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Can frogs find large independent sets in a decentralized way? Yes they can!

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8667, pp. 74-85

  3. Global DNA methylation: Uncommon event in oral lichenoid disease

    Oral Diseases, Vol. 20, Núm. 8, pp. 821-826

  4. Iterative probabilistic tree search for the minimum common string partition problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  5. Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8754, pp. 396-408