Sciweavers

438 search results - page 1 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
FOCS
1994
IEEE
13 years 9 months ago
A Theory of Competitive Analysis for Distributed Algorithms
Miklós Ajtai, James Aspnes, Cynthia Dwork, ...
SIAMCOMP
2012
11 years 7 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
DAGSTUHL
1996
13 years 6 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes
ICDCSW
2006
IEEE
13 years 11 months ago
Multi-radio channel allocation in competitive wireless networks
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
Márk Félegyházi, Mario Cagalj...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 2 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...