We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
In Mobile Ad hoc Network (MANET), mobility, traffic and node density are main network conditions that significantly affect the performance of routing protocols. Much of the previou...
Recent work have shown that it is possible to register multiple projectors on non-planar surfaces using a single uncalibrated camera instead of a calibrated stereo pair when deali...