Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...