We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
In recent years, AQM (Active Queue Management) mechanisms, which support the end-to-end congestion control mechanism of TCP by performing congestion control at a router, have been...