onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Providing Quality-of-Service (QoS) guarantees and mobility support for Internet devices has become a hot research topic in the Next Generation Internet research, since mobile compu...
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...