1254 search results - page 42 / 251 » Making Hard Problems Harder |
108
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
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 ...
118
Voted
PODC
2009
ACM
15 years 9 months ago
2009
ACM
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...
110
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
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...
84
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
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...
87
Voted
EUROPAR
2005
Springer
15 years 6 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...