14165 search results - page 172 / 2833 » The generalized two-server problem |
147
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
124
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
149
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
105
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
105
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...