835 search results - page 111 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
HEURISTICS
1998
13 years 10 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
TCS
2008
13 years 10 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
ICDCN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
DAM
2007
13 years 10 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...