Sciweavers

6129 search results - page 1025 / 1226
» A parallel LLL algorithm
Sort
View
SPAA
2009
ACM
14 years 11 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
SPAA
2009
ACM
14 years 11 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
PODC
2009
ACM
14 years 11 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 11 months ago
The price of anarchy is independent of the network topology
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...
Tim Roughgarden
ICDCS
2009
IEEE
14 years 5 months ago
On Optimal Concurrency Control for Optimistic Replication
Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, versi...
Weihan Wang, Cristiana Amza
« Prev « First page 1025 / 1226 Last » Next »