We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. denite clause programs containing probabilistic facts with a ...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...