The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
In this paper we apply a machine learning approach to the problem of estimating the number of defects called Regression via Classification (RvC). RvC initially automatically discr...
Stamatia Bibi, Grigorios Tsoumakas, Ioannis Stamel...
To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network, we present a coordinated scheduling method following the divisible load scheduling p...
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...