A type-theoretic approach to proof support for algebraic design frameworks 

    Mylonakis Pascual, Nicos (Date of defense: 2000-06-30)

    A TYPE -THEORETIC APPROACH TO PROOF SUPPORT FOR ALGEBRAIC <br/> DESIGN FRAMEWORKS<br/><br/><br/> En el desarrollo formal de software, ...

    Learning finite-state machines: statistical and algorithmic aspects 

    Balle Pigem, Borja de (Date of defense: 2013-07-12)

    The present thesis addresses several machine learning problems on generative and predictive models on sequential data. All the models considered have in common that they can be de ned in terms of nite-state machines. On ...

    On the intelligent management of sepsis in the intensive care unit 

    Ribas Ripoll, Vicent Jordi (Date of defense: 2013-01-29)

    The management of the Intensive Care Unit (ICU) in a hospital has its own, very specific requirements that involve, amongst others, issues of risk-adjusted mortality and average length of stay; nurse turnover and communication ...

    The Complexity of angel-daemons and game isomorphism 

    García Chacón, Alina (Date of defense: 2012-05-07)

    The analysis of the computational aspects of strategic situations is a basic field in Computer Sciences. Two main topics related to strategic games have been developed. First, introduction and analysis of a class of games ...

    Variants of unification considering compression and context variables 

    Gascón Caro, Adrià (Date of defense: 2014-05-30)

    Term unification is a basic operation in several areas of computer science, specially in those related to logic. Generally speaking, it consists on solving equations over expressions called terms. Depending on the kind of ...