In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
The relationships among autonomous systems (ASes) on the Internet are categorized into two major types: transit and peering. We propose a method for quantifying AS' network si...
Abstract—We present a protocol that uses a publish/subscribe approach to perform reliable but efficient actuation over a sensor network whose topology may change. Actuation on a...
We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining sp...
George F. Riley, Talal M. Jaafar, Richard M. Fujim...