2168 search results - page 246 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
132
click to vote
SMA
2003
ACM
15 years 9 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
128
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
158
click to vote
TALG
2010
14 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
170
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
115
Voted
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we consider a non-saturated IEEE 802.11 based wireless network. We use a three-way fixed point to model the node behavior with Bernoulli packet arrivals and determi...