Abstract. This paper studies the properties and performance of models for estimating local probability distributions which are used as components of larger probabilistic systems ...
Kristina Toutanova, Mark Mitchell, Christopher D. ...
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
—The success of server virtualization has let to the deployment of a huge number of virtual machines in today’s data centers, making a manual virtualization management very lab...
Matthias Bolte, Michael Sievers, Georg Birkenheuer...