In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
We have developed a new approach for reliably multicasting timecritical data to heterogeneous clients over mesh-based overlay networks. To facilitate intelligent content pruning, ...