Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...