34170 search results - page 6268 / 6834 » Optimization |
184
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
203
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
215
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
206
Voted
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
202
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Library-based record and replay tools aim to reproduce an application's execution by recording the results of selected functions in a log and during replay returning the resu...