In this paper we describe the ENSEMBLE-ROLLER planner submitted to the Learning Track of the International Planning Competition (IPC). The planner uses ensembles of relational classifiers to generate robust planning policies. As in other applications of machine learning, the idea of the ensembles of classifiers consists of providing accuracy for particular scenarios and diversity to cover a wid...

Web traction over rollers is known to deteriorate due to air entrainment at high web speeds. In this paper, a general model is presented to predict the traction capability of an impermeable web over a smooth roller. The model considers the effects of the web and roller speeds, roller radius, combined roughness of the two surfaces, web tension and thickness, friction coefficient, and compressibl...

A graph is well-covered if all its maximal independent sets are of the same cardinality [25]. If G is a well-covered graph, has at least two vertices, and G − v is well-covered for every vertex v, then G is a 1-well-covered graph [26]. We call G a λ-quasi-regularizable graph if λ · |S| ≤ |N (S)| for every independent set S of G. The independence polynomial I(G;x) is the generating function of i...

We have adapted the standard roller-tube apparatus to production of large scale cell culture by modifying the drum to accept bottles.