Ara mostrant els elements 46-65 de 83
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 nite-state machines. On ...
Romero Merino, Enrique (Data de defensa: 2004-11-30)
In terms of the Bias/Variance decomposition, very flexible (i.e., complex) Supervised Machine Learning systems may lead to unbiased estimators but with high variance. A rigid model, in contrast, may lead to small variance ...
Planas Hortal, Elena (Data de defensa: 2013-03-21)
Executable models play a key role in many development methods (such as MDD and MDA) by facilitating the immediate simulation/implementation of the software system under development. This is possible because executable ...
Blanco García, Enrique (Data de defensa: 2006-07-21)
Les seqüències són una de les estructures de dades més versàtils que existeixen. De forma relativament senzilla, en una seqüència de símbols es pot emmagatzemar informació de qualsevol tipus. L'anàlisi sistemàtic de ...
Moreno Ribas, Antonio (Data de defensa: 2000-12-18)
de la tesi doctoral<br/><br/>L'objectiu principal del treball realitzat ha sigut el desenvolupar una manera de modelar el procés d'investigació racional (l'evolució de les creences d'un agent racional com a conseqüència ...
Rollón, Emma (Data de defensa: 2008-11-03)
Many real-life optimization problems are combinatorial, i.e. they concern a choice of the best solution from a finite but exponentially large set of alternatives. Besides, the solution quality of many of these problems ...
Ameller, David (Data de defensa: 2014-01-23)
In the last decades, software engineering has become an important area of research. As researchers, we try to identify a problem, a need, or a hole in some research topic, once identified we make an effort to produce new ...
Delgado Pin, Jordi (Data de defensa: 1997-12-05)
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 formulas have short ...
Fairen Gonzalez, Marta (Data de defensa: 2000-11-23)
This thesis presents the design and implementation of a software development platform (ATLAS) which offers some tools and methods to greatly simplify the construction of fairly sophisticated applications. It allows thus ...
Ribas Ripoll, Vicent Jordi (Data de defensa: 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 ...
Ceccaroni, Luigi (Data de defensa: 2001-12-21)
Les contribucions d'aquesta tesi uneixen dues disciplines: ciències ambientals (específicament, gestió d'aigües residuals) i informàtica (específicament, intel·ligència artificial). El tractament d'aigües residuals com a ...
Màrquez, Lluís (Data de defensa: 1999-07-21)
The study and application of general Machine Learning (ML) algorithms to theclassical ambiguity problems in the area of Natural Language Processing (NLP) isa currently very active area of research. This trend is sometimes ...
Cabanillas, David (Data de defensa: 2009-04-01)
Large--scale distributed environments can be seen as a conflict between the selfish aims of the participants and the group welfare of the population as a whole. In order to regulate the behavior of the participants it is ...
Argelaguet Sanz, Fernando (Data de defensa: 2011-07-04)
Les contribucions d’aquesta tesi s’emmarquen en la interacció home-computador en entorns de realitat virtual. Concretament, en la millora de tasques de selecció d’objectes tridimensionals. La selecció d’objectes és una ...
Tolchinsky, Pancho (Data de defensa: 2012-07-09)
In this Thesis we present an argument-based model – ProCLAIM – intended to provide a setting for heterogeneous agents to deliberate on whether a proposed action is safe. That is, whether or not a proposed action is expected ...
López Arévalo, Iván (Data de defensa: 2005-11-05)
Els processos industrials requereixen avaluacions periòdiques per a verificar la seva correcta operació en termes tècnics i econòmics. Aquestes avaluacions són necessàries a causa de els canvis en els mercats i en la ...
Dürsteler, Juan Carlos (Data de defensa: 1991-12-09)
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 based on the classical ...
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 complexity ...