Ara mostrant els elements 31-37 de 37
Oliva Valls, Sergi (Data de defensa: 2013-05-02)
Propositional Proof Complexity is the area of Computational Complexity that studies the length of proofs in propositional logic. One of its main questions is to determine which particular propositional ...
Abío Roig, Ignasi (Data de defensa: 2013-05-15)
The topic of this thesis is the development of SAT-based techniques and tools for solving industrial combinatorial problems. First, it describes the architecture of state-of-the-art SAT and SMT Solvers ...
Ojeda Contreras, Jesús (Data de defensa: 2013-05-28)
Nowadays there is great demand for realistic simulations in the computer graphics field. Physically-based animations are commonly used, and one of the more complex problems in this field is fluid ...
Riquelme Csori, Fabián (Data de defensa: 2014-07-29)
Simple games are a fundamental class of cooperative games. They have a huge relevance in several areas of computer science, social sciences and discrete applied mathematics. The algorithmic and computational ...
Villegas Niño, Antonio (Data de defensa: 2013-01-29)
Cares Gallardo, Carlos (Data de defensa: 2012-09-20)
Since the i* framework emerged in the requirements engineering community in the mid-90s, different research groups have proposed variations to the modelling language proposed in the i* framework (¿the ...
Balle Pigem, Borja de (Data de defensa: 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 ...